Jeremy Dodson Howe

The Erdős–Gyárfás Conjecture for Cubic Graphs of Order 30

This record contains the preprint and complete reproducibility archive for a computer-assisted proof that every connected cubic graph on 30 vertices contains a cycle of length 4, 8, or 16. The proof partitions a hypothetical counterexample by its exact number of triangles, t = 0,...