Metraipolis › archive › dc_ef9c28d4a8da
A counterexample to the Fang--Lin conjecture: Edge and spectral extremality diverge near a Turán graph — arXiv:2609.37208
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.37208
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T18:33:38.139Z
- SHA-256 of the archived text
60da61fd52eb05a7db2a66ea9a3ab9168cd24d02e483f77469de1995f1e76b50- Stable URL of this page
https://metraipolis.com/documento/dc_ef9c28d4a8da
How to cite
A counterexample to the Fang--Lin conjecture: Edge and spectral extremality diverge near a Turán graph — arXiv:2609.37208 — arXiv (en), https://arxiv.org/abs/2609.37208 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ef9c28d4a8da (Metraipolis archive dc_ef9c28d4a8da, sha256 60da61fd52eb05a7db2a66ea9a3ab9168cd24d02e483f77469de1995f1e76b50)
BibTeX
@misc{dcef9c28d4a8da,
title = {A counterexample to the Fang--Lin conjecture: Edge and spectral extremality diverge near a Turán graph — arXiv:2609.37208},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.37208},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ef9c28d4a8da; sha256 60da61fd52eb05a7db2a66ea9a3ab9168cd24d02e483f77469de1995f1e76b50},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37208. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Fang and Lin [J. Algebraic Combin. 63 (2026), Art.~58] asked whether, whenever $F$ is edge-color-critical with $\chi(F)=r+1$, every non-$r$-partite, $F$-free graph of maximum adjacency spectral radius must also maximize the number of edges. We give a negative answer. Let $F=K_1\vee\mu(K_3)$, where $\mu(K_3)$ is the Mycielskian of a triangle. This graph is edge-color-critical with $\chi(F)=5$. We prove that $\SPEX_{5}(n,F)\cap\EX_{5}(n,F)=\varnothing$ for all sufficiently large $n$. Thus no graph can simultaneously maximize both the edge count and the spectral radius.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.37208 — 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-07T17:59:19.217Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).