# Szekeres, George

## Erdös-Szekeres conjecture ★★★

\begin{conjecture} Every set of $2^{n-2} + 1$ points in the plane in general position contains a subset of $n$ points which form a convex $n$-gon. \end{conjecture}

Keywords: combinatorial geometry; Convex Polygons; ramsey theory

## Cycle double cover conjecture ★★★★

\begin{conjecture} For every graph with no \Def[bridge]{bridge (graph theory)}, there is a list of cycles so that every edge is contained in exactly two. \end{conjecture}