Some Combinatorial Theorems on Monotonicity
Canadian mathematical bulletin, Tome 14 (1971) no. 2, pp. 151-157
Voir la notice de l'article provenant de la source Cambridge
P. Erdös and G. Szekeres [1] proved that from any points in the plane one can always choose n + 1 of them which are the vertices of a convex polygon, thus answering a question due to Miss Esther Klein (who later became Mrs. G. Szekeres).
Chvátal, V.; Komlόs, J. Some Combinatorial Theorems on Monotonicity. Canadian mathematical bulletin, Tome 14 (1971) no. 2, pp. 151-157. doi: 10.4153/CMB-1971-028-8
@article{10_4153_CMB_1971_028_8,
author = {Chv\'atal, V. and Koml\'{o}s, J.},
title = {Some {Combinatorial} {Theorems} on {Monotonicity}},
journal = {Canadian mathematical bulletin},
pages = {151--157},
year = {1971},
volume = {14},
number = {2},
doi = {10.4153/CMB-1971-028-8},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1971-028-8/}
}
Cité par Sources :