arXiv (All)
open access
A counterexample to the Fang--Lin conjecture: Edge and spectral extremality diverge near a Turán graph
Fang and Lin [J. Algebraic Combin. 63 (2026), Art.~58] asked whether, whenever $F$ is edge-color-critical with $χ(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μ(K_3)$, where $μ(K_3
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- $c$-Packedness versus $λ$-Low-Density in Geometric Graphs: Theory and Practice#1063442
- A counterexample to the quantum Hedetniemi conjecture#1034490
- A solution to a conjecture on the signless Laplacian spectral radius for $t$-color-critical graphs#1035773
- A Sharp Product Bound for Disjoint Cross-Intersecting 3-Graphs with Covering Number Three#1062106
- Fractional DP-colorings of $d$-degenerate locally sparse graphs#1069949
Record · ID 1132409
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive