Cover Image

Happy Ending: An Empty Hexagon in Every Set of 30 Points

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Heule, Marijn J. H., Scheucher, Manfred
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry Logic in Computer Science Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Formal Verification of the Empty Hexagon Number
by: Subercaseaux, Bernardo, et al.
Published: (2024)

Finding hardness reductions automatically using SAT solvers
by: Bergold, Helena, et al.
Published: (2024)

k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
by: Hliněný, Petr, et al.
Published: (2025)

Automated Reencoding Meets Graph Theory
by: Przybocki, Benjamin, et al.
Published: (2026)

Formalizing $A_1^{(1)}$ Curve Neighborhoods in Lean 4
by: Huang, Yihe, et al.
Published: (2026)

Investigating Simple Drawings of $K_n$ using SAT
by: Bergold, Helena, et al.
Published: (2025)

Orbitopal Fixing in SAT
by: Anders, Markus, et al.
Published: (2026)

Certified Knowledge Compilation with Application to Formally Verified Model Counting
by: Bryant, Randal E., et al.
Published: (2025)

Partitioning Theorems for Sets of Semi-Pfaffian Sets, with Applications
by: Lotz, Martin, et al.
Published: (2024)

Indivisibility and uniform computational strength
by: Gill, Kenneth
Published: (2023)

Decomposing graphs into stable and ordered parts
by: Buffière, Hector, et al.
Published: (2025)

Monadic Second-Order Logic of Permutations
by: Jelínek, Vít, et al.
Published: (2025)

Decidability for Sturmian words
by: Hieronymi, Philipp, et al.
Published: (2021)

Agnostic Online Learning and Excellent Sets
by: Malliaris, Maryanthe, et al.
Published: (2021)

SAT + NAUTY: Orderly Generation of Small Kochen-Specker Sets Containing the Smallest State-independent Contextuality Set
by: Li, Zhengyu, et al.
Published: (2026)

A very sharp threshold for first order logic distinguishability of random graphs
by: Benjamini, Itai, et al.
Published: (2022)

Plane Hamiltonian Cycles in Convex Drawings
by: Bergold, Helena, et al.
Published: (2024)

Symbolic Sets for Proving Bounds on Rado Numbers
by: Ahmed, Tanbir, et al.
Published: (2025)

North-East Lattice Paths Avoiding $k$ Collinear Points via Satisfiability
by: Barnoff, Aaron, et al.
Published: (2025)

A Formal Proof of R(4,5)=25
by: Gauthier, Thibault, et al.
Published: (2024)

Tutte's theorem as an educational formalization project
by: Otte, Pim
Published: (2025)

Convergence Laws for Extensions of First-Order Logic with Averaging
by: Adam-Day, Sam, et al.
Published: (2025)

Two variable logic with ultimately periodic counting
by: Benedikt, Michael, et al.
Published: (2020)

Further Comments on Yablo's Construction
by: Schlechta, Karl
Published: (2025)

Local structure of idempotent algebras II
by: Bulatov, Andrei A.
Published: (2020)

Additive systems for $\mathbb{Z}$ are undecidable
by: Zabolotskii, Andrei
Published: (2025)

On Planarity of Graphs in Homotopy Type Theory
by: Prieto-Cubides, Jonathan, et al.
Published: (2021)

Transductions of Graph Classes Admitting Product Structure
by: Hliněný, Petr, et al.
Published: (2025)

Bijections between planar maps and planar linear normal $λ$-terms with connectivity condition
by: Fang, Wenjie
Published: (2022)

Composition Direction of Seymour's Theorem for Regular Matroids -- Formally Verified
by: Dvorak, Martin, et al.
Published: (2025)

PackIt! Gamified Rectangle Packing
by: Garrison, Thomas, et al.
Published: (2024)

Advances in Algorithmic Meta Theorems
by: Siebertz, Sebastian, et al.
Published: (2024)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
by: Dreier, Jan, et al.
Published: (2024)

Separability Properties of Monadically Dependent Graph Classes
by: Bonnet, Édouard, et al.
Published: (2025)

Existential Positive Transductions of Sparse Graphs
by: Mählmann, Nikolas, et al.
Published: (2026)

Characterizations of monadically dependent tree-ordered weakly sparse structures
by: Buffière, Hector, et al.
Published: (2026)

Decomposition horizons and a characterization of stable hereditary classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

Epsilon-saturation for stable graphs and Littlestone classes
by: Malliaris, Maryanthe, et al.
Published: (2025)

On first-order transductions of classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
by: Mählmann, Nikolas
Published: (2025)