A SAT attack on higher dimensional Erdős-Szekeres numbers
From MaRDI portal
Publication:6604680
DOI10.1007/978-3-030-83823-2_17MaRDI QIDQ6604680
Publication date: 13 September 2024
computer-assisted proofchirotopeBoolean satisfiability (SAT)Erdös-Szekeres theoremhigher dimensional point set
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points
- Two disjoint 5-holes in point sets
- Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
- Konvexe Fünfecke in ebenen Punktmengen
- Some Erdős-Szekeres type results about points in space
- On empty convex polytopes
- Point configurations in \(d\)-space without large subsets in convex position
- Finding sets of points without empty convex 6-gons
- Two extensions of the Erdős-Szekeres problem
- The empty hexagon theorem
- Empty convex hexagons in planar point sets
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Computer solution to the 17-point Erdős-Szekeres problem
- Sets with No Empty Convex 7-Gons
- The Erdos-Szekeres problem on points in convex position – a survey
- Oriented Matroids
- On the Erdős-Szekeres convex polygon problem
- Ramsey-remainder for convex sets and the Erdős-Szekeres theorem
This page was built for publication: A SAT attack on higher dimensional Erdős-Szekeres numbers
