For color-critical F with χ(F)=r+1≥4, λ²(G) ≥ 2(1-1/r)m + q implies N_F(G) ≥ (B_F - o(1)) q m^{(f-2)/2} for small q, with sharp B_F = α_F/4 ⋅ (2r/(r-1))^{f/2}.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.CO 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
The unique minimizer of the distance spectral radius among connected graphs with m edges is the complement of a balanced disjoint union of paths.
For sufficiently large n, G(2,4) is the blow-up of the Grötzsch graph.
citing papers explorer
-
An edge-spectral supersaturation of Mubayi's theorem for color-critical graphs
For color-critical F with χ(F)=r+1≥4, λ²(G) ≥ 2(1-1/r)m + q implies N_F(G) ≥ (B_F - o(1)) q m^{(f-2)/2} for small q, with sharp B_F = α_F/4 ⋅ (2r/(r-1))^{f/2}.
-
On a conjecture of distance spectral extremal problems
The unique minimizer of the distance spectral radius among connected graphs with m edges is the complement of a balanced disjoint union of paths.
-
Spectral extremal results for triangle-free graphs with chromatic number at least four
For sufficiently large n, G(2,4) is the blow-up of the Grötzsch graph.