Metraipolis › archive › dc_c07f665ed86c
Towards a more structured search for Erdős-Gyárfás counter-examples — arXiv:2609.28594
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.28594
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:36:37.276Z
- SHA-256 of the archived text
5a07defe7f7e3fee1b02cda4b0163a1e58cc29881d1da203037cc01056d22799- Stable URL of this page
https://metraipolis.com/documento/dc_c07f665ed86c
How to cite
Towards a more structured search for Erdős-Gyárfás counter-examples — arXiv:2609.28594 — arXiv (en), https://arxiv.org/abs/2609.28594 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c07f665ed86c (Metraipolis archive dc_c07f665ed86c, sha256 5a07defe7f7e3fee1b02cda4b0163a1e58cc29881d1da203037cc01056d22799)
BibTeX
@misc{dcc07f665ed86c,
title = {Towards a more structured search for Erdős-Gyárfás counter-examples — arXiv:2609.28594},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.28594},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c07f665ed86c; sha256 5a07defe7f7e3fee1b02cda4b0163a1e58cc29881d1da203037cc01056d22799},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.28594. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Erdős-Gyárfás conjecture posits that every graph with minimum degree at least three contains a cycle of length some power of two. We prove a few simple structural properties for any minimal counter-example to this conjecture. In particular, the fraction of its vertices of degree three must be greater than $2/3$, thus improving on the prior bound of $4/7$ (Carr, 2026). Furthermore, it is either biconnected or the $1$-clique-sum of two biconnected graphs. By exploiting some of these properties, we were able to verify the conjecture for every graph of order at most $40$, every bipartite graph of order at most $66$, and every cubic graph of order at most $48$. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.28594 — 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-08T06:02:09.998Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).