Combinatorics (Fall 2010)/Ramsey theory: Difference between revisions
Jump to navigation
Jump to search
imported>WikiSysop |
imported>WikiSysop |
||
Line 6: | Line 6: | ||
:Any set of 5 points in the plane, no three on a line, has a subset of 4 points that form the vertices of a convex quadrilateral. | :Any set of 5 points in the plane, no three on a line, has a subset of 4 points that form the vertices of a convex quadrilateral. | ||
}} | }} | ||
See the article | |||
[http://www.maa.org/mathland/mathtrek_10_3_00.html] for the proof. | |||
{{Theorem|Theorem (Erdős-Szekeres 1935)| | {{Theorem|Theorem (Erdős-Szekeres 1935)| |
Revision as of 08:21, 17 November 2010
Ramsey's Theorem
Ramsey number
The "Happy Ending" problem
The happy ending problem - Any set of 5 points in the plane, no three on a line, has a subset of 4 points that form the vertices of a convex quadrilateral.
See the article [1] for the proof.
Theorem (Erdős-Szekeres 1935) - For any positive integer [math]\displaystyle{ n\ge 3 }[/math], there is an [math]\displaystyle{ N(n) }[/math] such that any collection of [math]\displaystyle{ N\ge N(n) }[/math] points in the Euclidian plane, no three of which are collinear, has a subset of [math]\displaystyle{ n }[/math] points forming a convex [math]\displaystyle{ n }[/math]-gon.