Szekeres, George

Erdös-Szekeres conjecture ★★★

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.

Posted by mdevos
updated April 14th, 2009

Conjecture For every graph with no bridge, there is a list of cycles so that every edge is contained in exactly two.

Keywords: cover; cycle

Posted by mdevos
updated February 7th, 2012