A SAT attack on the Erd?s–Szekeres conjecture

摘要

Abstract A classical conjecture of Erd?s and Szekeres states that, for every integer k ≥ 2 , every set of 2 k ? 2 + 1 points in the plane in general position contains k points in convex position. In 2006, Peters and Szekeres introduced the following stronger conjecture: every red-blue coloring of the edges of the ordered complete 3-uniform hypergraph on 2 k