The minimum number of monotone subsequences

Electronic Journal of Combinatorics

Volumn 9, Issue 2 R, 2002, Pages

  Myers, Joseph Samuel ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042580899     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1676     Document Type: Article

References (6)

1. P. Erdos, On the number of complete subgraphs contained in certain graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl. 7 (1962), no. 3, 459-464.
2. Pál Erdos and George Szekeres, A combinatorial problem in geometry, Compositio Math. 2 (1935), 463-470.
3. A. W. Goodman, On sets of acquaintances and strangers at any party, Amer. Math. Monthly 66 (1959), no. 9, 778-783.
4. Gary Lorden, Blue-empty chromatic graphs, Amer. Math. Monthly 69 (1962), no. 2, 114-120.
5. J. Michael Steele, Variations on the monotone subsequence theme of Erdos and Szekeres, Discrete probability and algorithms (Minneapolis, MN, 1993) (David Aldous, Persi Diaconis, Joel Spencer, and J. Michael Steele, eds.), IMA Vol. Math. Appl. 72, Springer-Verlag, 1995, pp. 111-131.
6. Andrew Thomason, A disproof of a conjecture of Erdos in Ramsey theory, J. London Math. Soc. (2) 39 (1989), no. 2, 246-255.