A SAT attack on the Erdős-Szekeres conjecture

DOI10.1016/j.ejc.2017.06.010zbMath1369.05063OpenAlexW2735179260WikidataQ123211337 ScholiaQ123211337MaRDI QIDQ5920081

Martin Balko, Pavel Valtr

Publication date: 11 September 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2017.06.010

zbMATH Keywords

SAT solvers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Two disjoint 5-holes in point sets ⋮ Faradžev Read-type enumeration of non-isomorphic CC systems ⋮ On orthogonal symmetric chain decompositions

Uses Software

• Glucose

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved upper bound for the Erdős-Szekeres conjecture
• Erdős-Szekeres without induction
• Axioms and hulls
• Forced convex \(n\)-gons in the plane
• Finding convex sets among points in the plane
• Note on the Erdős-Szekeres theorem
• Ramsey-remainder
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• Erdős-Szekeres-type theorems for monotone paths and convex bodies
• Computer solution to the 17-point Erdős-Szekeres problem
• On the Erdős-Szekeres convex polygon problem
• A SAT attack on the Erdős-Szekeres conjecture

This page was built for publication: A SAT attack on the Erdős-Szekeres conjecture