Formal verification of the empty hexagon number
From MaRDI portal
Cites work
- A combinatorial problem in geometry.
- Axioms and hulls
- Computer solution to the 17-point Erdős-Szekeres problem
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Effective auxiliary variables via structured reencoding
- Efficient verified (UN)SAT certificate checking
- Empty convex hexagons in planar point sets
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
- Formally proving the Boolean Pythagorean triples conjecture
- Formally verifying the solution to the Boolean Pythagorean triples problem
- scientific article; zbMATH DE number 3168302 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Konvexe Fünfecke in ebenen Punktmengen
- On the Erdős-Szekeres convex polygon problem
- Sets with No Empty Convex 7-Gons
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Sweeps, arrangements and signotopes
- The empty hexagon theorem
- The Lean theorem prover (system description)
- The packing chromatic number of the infinite square grid is 15
- Two disjoint 5-holes in point sets
- versat: A Verified Modern SAT Solver
Cited in
(4)
This page was built for publication: Formal verification of the empty hexagon number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859990)
