Metraipolis › archive › dc_3e366a8fb29d
Proving a conjecture concerning chromatic number, size and least eigenvalue — arXiv:2608.03271
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.03271
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T12:55:47.609Z
- SHA-256 of the archived text
5482c6335c4fab33e48a6ed6de99a2db0e16e992287f13743bb478acd75d8433- Stable URL of this page
https://metraipolis.com/documento/dc_3e366a8fb29d
How to cite
Proving a conjecture concerning chromatic number, size and least eigenvalue — arXiv:2608.03271 — arXiv (en), https://arxiv.org/abs/2608.03271 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3e366a8fb29d (Metraipolis archive dc_3e366a8fb29d, sha256 5482c6335c4fab33e48a6ed6de99a2db0e16e992287f13743bb478acd75d8433)
BibTeX
@misc{dc3e366a8fb29d,
title = {Proving a conjecture concerning chromatic number, size and least eigenvalue — arXiv:2608.03271},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.03271},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3e366a8fb29d; sha256 5482c6335c4fab33e48a6ed6de99a2db0e16e992287f13743bb478acd75d8433},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.03271. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $G$ be a simple nonempty graph with size $m$, chromatic number $\chi$, and least eigenvalue $\lambda$. We prove that \[ \chi(\chi-1) \le (m+1-\lambda^2)+\sqrt{(m+1-\lambda^2)^2-4(\lambda^2-1)(\lambda^2-m)} \] with equality if and only if $G$ is either a complete graph or a complete bipartite graph, with possibly isolated vertices. The inequality was conjectured recently by Tang and Elphick in [Electron. J. Combin. 33 (2026), \#P2.65].
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.03271 — 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.767Z 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).