论文信息 - A Remark on the Erdős-Szekeres Theorem

A Remark on the Erdős-Szekeres Theorem

Combin. Theory (A) 42 (1986) 15–30. 6. D. Foata, Enumerating k-trees, Discrete Math. 1 (1971) 181–186. 7. J. Hage, Enumerating submultisets of multisets, Inf. Proc. Letters 85 (2003) 221–226. 8. J. W. Moon, Various proofs of Cayley’s formula for counting trees, in A Seminar on Graph Theory, F. Harary, ed., Holt, New York, 1967, pp. 70–78. 9. H. Prüfer, Neuer Beweis eines Satzes über Permutationen, Arch. Math. Phys. 27 (1918) 142–144.

Adrian Dumitrescu

[1] Jj Anos Pach. Erd} Os-szekeres-type Theorems for Segments and Non-crossing Convex Sets , 1998 .

[2] V. Soltan,et al. The Erdos-Szekeres problem on points in convex position – a survey , 2000 .

[3] Tibor Bisztriczky,et al. Convexly independent sets , 1990, Comb..

[4] János Pach,et al. A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets , 1998, Discret. Comput. Geom..

[5] Mark H. Overmars. Finding Sets of Points without Empty Convex 6-Gons , 2003, Discret. Comput. Geom..

[6] János Pach,et al. Erdős–Szekeres-Type Theorems for Segments and Noncrossing Convex Sets , 2000 .

[7] J. Horton. Sets with No Empty Convex 7-Gons , 1983, Canadian Mathematical Bulletin.

[8] Arie Bialostocki,et al. Some notes on the Erdös-Szekeres theorem , 1990, Discret. Math..

[9] Paul Erdös. On some problems of elementary and combinatorial geometry , 1975 .

[10] Pavel Valtr. A Sufficient Condition for the Existence of Large Empty Convex Polygons , 2002, Discret. Comput. Geom..