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: 84 times

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