![](/files/happy5.png)
Szekeres, George
Erdös-Szekeres conjecture ★★★
Conjecture Every set of
points in the plane in general position contains a subset of
points which form a convex
-gon.
![$ 2^{n-2} + 1 $](/files/tex/78669eb6d8b95f5ad57efe25b8ed4f27b42cb6f6.png)
![$ n $](/files/tex/ec63d7020a64c039d5f6703b8fa3ab7393358b5b.png)
![$ n $](/files/tex/ec63d7020a64c039d5f6703b8fa3ab7393358b5b.png)
Keywords: combinatorial geometry; Convex Polygons; ramsey theory
Cycle double cover conjecture ★★★★
Conjecture For every graph with no bridge, there is a list of cycles so that every edge is contained in exactly two.
![Syndicate content Syndicate content](/misc/feed.png)