Combinatorics and Graph Theory


A Note on Erdős-Szekeres Theorem

Authors: M. Romig

Erdős-Szekeres Theorem is proven. The proof is very similar to the original given by Erdős and Szekeres. However, it explicitly uses properties of binary trees to prove and visualize the existence of a monotonic subsequence. It is hoped that this presentation is helpful for pedagogical purposes.

Comments: 4 Pages.

Download: PDF

Submission history

[v1] 2015-05-24 23:28:45

Unique-IP document downloads: 107 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus