Edge-spectral supersaturation and stability: Resolving a problem on color-critical subgraphs
math.CO
Submitted: 2026-03-16
Updated: 2026-11-03
Terminology
Sources
- Spectral supersaturation for color-critical graphs
- A spectral Lov'{a}sz-Simonovits theorem
- An edge-spectral Erd\H{o}s-Stone-Simonovits theorem and its stability
- More on Nosal's spectral theorem: Books and $4$-cycles
- Edge-spectral Tur'{a}n theorems for color-critical graphs with applications
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality