no. 8 · Wednesday 4 November 2026
Edge-spectral supersaturation and stability: Resolving a problem on color-critical subgraphs
Abstract
Inspired by Mubayi's work on the supersaturation of color-critical subgraphs, we investigate its edge-spectral counterpart: determining the minimum number of copies of a color-critical subgraph in a graph whose spectral radius exceeds the corresponding extremal threshold. While earlier breakthroughs by Bollobás and Nikiforov, Ning and Zhai, and Li, Liu, and Zhang provided edge-spectral supersaturation results for the complete graph, the general problem for color-critical graphs has remained open. In this paper, we strengthen existing results by studying all color-critical graphs \(F\) with \(χ(F)=r+1\geq 4\). Specifically, we prove that if $ρ(G)\!>\!\sqrt{(1\!-\!1/r)2m}$, then the number of copies of \(F\) in \(G\) satisfies $N_F(G) \geq \bigl(γ_F-o(1)\bigr)m^{(|F|-2)/2},$ where both the order of magnitude and the leading constant \(γ_F\) are optimal. The above supersaturation statement is derived from a more general edge-spectral supersaturation and stability framework. Classically, a theorem of Erdős and Simonovits [Combinatorica, 1983] asserts that any $n$-vertex graph with edge density strictly exceeding the Turán density of $F$ must contain $Ω(n^{|F|})$ copies of $F$. By applying the progressive induction method to spectral extremal problems, we establish a comprehensive edge-spectral analogue of the Erdős–Simonovits theorem. Beyond obtaining the asymptotic upper bounds on the spectral radius $ρ(G)$ under the condition $N_F(G) = o(m^{|F|/2})$, we further establish a sharp stability result. Our work strengthens both the classical Erdős–Stone–Simonovits theorem and Nikiforov's spectral stability theorem by extending the setting from $F$-free graphs to graphs containing only a limited number of copies of $F$. We conclude with several open problems in spectral supersaturation.
- fields
- Combinatorics