scientific article; zbMATH DE number 7779755
From MaRDI portal
Publication:6179339
DOI10.57717/cgt.v2i1.12MaRDI QIDQ6179339
Publication date: 16 December 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
automated reasoningErdős-Szekeres theoremoriented matroidcomputer-assisted proofBoolean satisfiability (SAT)\(k\)-hole\(k\)-gonacyclic chirotopeempty hexagon theoremhigher-dimensional point set
Erd?s problems and related topics of discrete geometry (52C10) Oriented matroids in discrete geometry (52C40) Computer assisted proofs of proofs-by-exhaustion type (68V05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the finding of final polynomials
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points
- Two disjoint 5-holes in point sets
- Abstract order type extension and new results on the rectilinear crossing number
- Convex independent sets and 7-holes in restricted planar point sets
- Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
- Axioms and hulls
- Konvexe Fünfecke in ebenen Punktmengen
- Some Erdős-Szekeres type results about points in space
- On empty convex polytopes
- Generation of oriented matroids --- a graph theoretical approach
- Point configurations in \(d\)-space without large subsets in convex position
- Enumerating order types for small point sets with applications
- Finding sets of points without empty convex 6-gons
- Representing graphs and hypergraphs by touching polygons in 3D
- Two extensions of the Erdős-Szekeres problem
- On 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
- On Convex Polygons Determined by a Finite Planar Set
- The Erdos-Szekeres problem on points in convex position – a survey
- Oriented Matroids
- On the Erdős-Szekeres convex polygon problem
- On convex holes in d-dimensional point sets
- Sweeps, arrangements and signotopes
- Ramsey-remainder for convex sets and the Erdős-Szekeres theorem
This page was built for publication: