A SAT attack on higher dimensional Erdős-Szekeres numbers
From MaRDI portal
Publication:6604680
Cites work
- scientific article; zbMATH DE number 3649571 (Why is no real title available?)
- scientific article; zbMATH DE number 5019923 (Why is no real title available?)
- scientific article; zbMATH DE number 3354154 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- Computer solution to the 17-point Erdős-Szekeres problem
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Empty convex hexagons in planar point sets
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points
- Finding sets of points without empty convex 6-gons
- Konvexe Fünfecke in ebenen Punktmengen
- On empty convex polytopes
- On the Erdős-Szekeres convex polygon problem
- Oriented Matroids
- Point configurations in \(d\)-space without large subsets in convex position
- Ramsey-remainder for convex sets and the Erdős-Szekeres theorem
- Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
- Sets with No Empty Convex 7-Gons
- Some Erdős-Szekeres type results about points in space
- The Erdos-Szekeres problem on points in convex position – a survey
- The crossing Tverberg theorem
- The empty hexagon theorem
- Two disjoint 5-holes in point sets
- Two extensions of the Erdős-Szekeres problem
This page was built for publication: A SAT attack on higher dimensional Erdős-Szekeres numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604680)
