Sidorenko's conjecture is equivalent to hom(H,G) ≥ λ(G)^{2e-v} M(G)^{v-e}, which yields asymptotically sharp supersaturation bounds for the number of K_{t,t} and C_{2t} in graphs with λ(G) > λ(S_{t-1,m}).
Nikiforov, On a theorem of Nosal, (2021), arXiv:2104.12171
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.CO 3representative citing papers
The paper establishes asymptotic lower bounds on shared-edge triangles, shared-vertex cliques, and C4 copies in graphs with spectral radius > √m, confirming three conjectures with matching constructions.
For color-critical F with χ(F)=r+1≥4, λ²(G)≥2(1-1/r)m+q with 0<q≤δ_F√m forces at least (B_F-o(1))q m^{(f-2)/2} copies of F, and B_F is best possible.
citing papers explorer
-
Spectral Sidorenko inequalities and edge-spectral supersaturation
Sidorenko's conjecture is equivalent to hom(H,G) ≥ λ(G)^{2e-v} M(G)^{v-e}, which yields asymptotically sharp supersaturation bounds for the number of K_{t,t} and C_{2t} in graphs with λ(G) > λ(S_{t-1,m}).
-
More on Nosal's spectral theorem: Books and $4$-cycles
The paper establishes asymptotic lower bounds on shared-edge triangles, shared-vertex cliques, and C4 copies in graphs with spectral radius > √m, confirming three conjectures with matching constructions.
-
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 with 0<q≤δ_F√m forces at least (B_F-o(1))q m^{(f-2)/2} copies of F, and B_F is best possible.