Geodesic
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 University Press

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/}
}
TY  - JOUR
AU  - Chvátal, V.
AU  - Komlόs, J.
TI  - Some Combinatorial Theorems on Monotonicity
JO  - Canadian mathematical bulletin
PY  - 1971
SP  - 151
EP  - 157
VL  - 14
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1971-028-8/
DO  - 10.4153/CMB-1971-028-8
ID  - 10_4153_CMB_1971_028_8
ER  - 
%0 Journal Article
%A Chvátal, V.
%A Komlόs, J.
%T Some Combinatorial Theorems on Monotonicity
%J Canadian mathematical bulletin
%D 1971
%P 151-157
%V 14
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1971-028-8/
%R 10.4153/CMB-1971-028-8
%F 10_4153_CMB_1971_028_8

[1] 1. Erdös, P. and Szekeres, G., A combinatorial problem in geometry, Compositio Math. 2 (1935), 463-470. Google Scholar

[2] 2. Gallai, T., On directed paths and circuits. Theory of graphs (edited by P. Erdös and G. Katona), Academic Press, 1968. Google Scholar

[3] 3. Hedrlin, Z. and Pultr, A., Relations (graphs) with given finitely generated semigroups, Mh. Math. 68 (1964), 213-217. Google Scholar

Cité par Sources :