Counting K 4-saturating non-edges in Nosal graphs
math.CO
Submitted: 2026-11-10
Updated: 2026-11-10
Terminology
Sources
- Supersaturation in Nosal graphs: Triangles and books
- An edge-spectral Erd\H{o}s-Stone-Simonovits theorem and its stability
- Edge-spectral Tur'{a}n theorems for color-critical graphs with applications
- On a theorem of Nosal
- Two problems on booksize and triangular edges in Nosal graphs
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