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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
For large m and s with s/m approaching a constant c in (0,1/2], m-edge graphs satisfying ρ₁² ≥ m-1 + 2s/(ρ₁-1) contain at least s triangles, with extremal graphs characterized; this settles the Li-Feng-Peng conjecture when s=(m-1)/2.
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}.
-
A spectral threshold for triangle counting
For large m and s with s/m approaching a constant c in (0,1/2], m-edge graphs satisfying ρ₁² ≥ m-1 + 2s/(ρ₁-1) contain at least s triangles, with extremal graphs characterized; this settles the Li-Feng-Peng conjecture when s=(m-1)/2.