Metraipolis › archive › dc_65b443cdda3f
A 60-Vertex Lower Bound for Cubic Bipartite Counterexamples to the Erdős-Gyárfás Conjecture — arXiv:2608.02675
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.02675
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T12:55:44.894Z
- SHA-256 of the archived text
e2b365a374c66282b5886e605a1cd4cb9479065d21bb25b0861f34a081447a25- Stable URL of this page
https://metraipolis.com/documento/dc_65b443cdda3f
How to cite
A 60-Vertex Lower Bound for Cubic Bipartite Counterexamples to the Erdős-Gyárfás Conjecture — arXiv:2608.02675 — arXiv (en), https://arxiv.org/abs/2608.02675 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_65b443cdda3f (Metraipolis archive dc_65b443cdda3f, sha256 e2b365a374c66282b5886e605a1cd4cb9479065d21bb25b0861f34a081447a25)
BibTeX
@misc{dc65b443cdda3f,
title = {A 60-Vertex Lower Bound for Cubic Bipartite Counterexamples to the Erdős-Gyárfás Conjecture — arXiv:2608.02675},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.02675},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_65b443cdda3f; sha256 e2b365a374c66282b5886e605a1cd4cb9479065d21bb25b0861f34a081447a25},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.02675. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A certified exhaustive computation shows that every simple cubic bipartite graph on at most 58 vertices contains a cycle of length 4, 8, or 16. Consequently, any cubic bipartite counterexample to the Erdos-Gyarfas conjecture has at least 60 vertices, improving the established published lower bound for this class from 30 to 60. The proof begins with a Moore-bound observation: below 62 vertices, a cubic bipartite graph avoiding 4- and 8-cycles must contain a 6-cycle. Viewing the graph as the Levi graph of a linear symmetric v3-configuration turns this 6-cycle into a Berge triangle. Up to symmetry, only two rooted extensions are possible. A complete restricted-growth search on at most 29 points exhausts both search trees. The computation is checked by two separately implemented exact procedures using different C16 oracles and by a static witness certificate. Source code, certificates, and reproduction instructions are archived with the paper. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-05 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2608.02675 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-31T12:42:47.749Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).