The only Class 0 Flower snark is the smallest
math.CO, cs.DM
Submitted: 2025-05-28
Updated: 2026-11-05
Comments: 10 pages, 6 figures. Proof reorganized and discussion improved. Supplementary software available at https://github.com/gabridi/pebbling_unsolvability
Code: https://github.com/gabridi/pebbling
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality