A Theorem on Erdos Sequences
Received:February 25, 1993  
Key Words: permutation   decreasing sequence   increasing sequence   bicolor graph.  
Fund Project:
Author NameAffiliation
Shen Zechun Engineering College of Anshan Iron & Steel CompanyAnshan 114002 
Hits: 2414
Download times: 1143
Abstract:
      It is shown that the product of the two largest lengths of the longest decreas-ing and increasing subsequences in any sequence composed of n distinct numbers is notless than n, whilst the sum of the two length is not less that Finally, it is pointedout that a result of Erds and Szekeres is an immediate consequence of the theorem ofthis paper, but not vice versa.
Citation:
DOI:10.3770/j.issn:1000-341X.1995.02.004
View Full Text  View/Add Comment