Ramsey-remainder

European Journal of Combinatorics

Volumn 17, Issue 6, 1996, Pages 519-532

  Erdos, Paul ^a   Tuza, Zsolt ^b   Valtr, Pavel ^c,d  

^a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^c CHARLES UNIVERSITY   (Czech Republic)

^d FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21344455693     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1996.0045     Document Type: Article

References (8)

1. Y. Caro and Zs. Tuza, Decompostions of partially ordered sets into chains and antichains of given size, Order, 5 (1988), 245-255.
2. R. P. Dilworth, A decomposition theorem for partially ordered sets, Ann. Math. 51 (1950), 161-166.
3. P. Erdos, Some remarks on the theory of graphs, Bull. Am. Math. Soc., 53 (1947), 292-294.
4. P. Erdos and G. Szekeres, A combinatorial problem in geometry, Compositio Math., 2 (1935), 463-470.
5. P. Erdos and G. Szekeres, On some extremum problems in elementary geometry, Ann. Univ. Sci. Budapest, 3/4 (1960/61), 53-62.
6. Z. Lonc and M. Truszczyński, Decomposition of large uniform hypergraphs, Order, 1 (1985), 345-350.
7. J. Nešetřil and V. Rödl (eds), Mathematics of Ramsey Theory, Springer-Verlag, Berlin, 1990.
8. F. P. Ramsey, On a problem of formal logic, Proc. Lond. Math. Soc., II. Ser., 30 (1930), 264-286.