Supersaturation in Nosal graphs: Triangles and books
Abstract
In this paper, we use the spectral surplus to measure how far lies above the Nosal threshold, and prove the following edge-spectral supersaturation results for triangles and books. (a) Every graph with edges and contains at least triangles, with equality if and only if . This can be viewed as the third-layer supersaturation in the jump phenomenon, after the first layer proved by Ning and Zhai, and the second layer by Zhang and Zhai. (b) Every -edge graph satisfies , with equality if and only if is complete bipartite. Consequently, forces for every real . This is an edge-spectral counterpart of the Lov\'asz--Simonovits theorem, and it improves the Bollob\'as--Nikiforov bound in the range . (c) Every -edge Nosal graph contains a book of size greater than . This improves two recent results on the booksize constant: proved by Li, Liu and Zhang, and by Zhai, Li and Lou. This narrows the gap toward the conjectured optimal constant . (d) Every -edge Nosal graph contains at least copies of the kite , and the constant is best possible. This determines the sharp asymptotic constant for counting and strengthens the bound of Li, Liu and Zhang.
Cite
@article{arxiv.2607.16746,
title = {Supersaturation in Nosal graphs: Triangles and books},
author = {Hongzhang Chen and Yongtao Li and Quanyu Tang},
journal= {arXiv preprint arXiv:2607.16746},
year = {2026}
}
Comments
31 pages, 1 figure. Spectral extremal graph theory