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}).
Coregliano and Alexander A
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Tensor-amplification framework proves equality regularization and spectral equivalence for C-Sidorenko graphs in admissible graphon classes.
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}).
-
Tensor Amplification and Spectral Transfer for Sidorenko-Type Inequalities
Tensor-amplification framework proves equality regularization and spectral equivalence for C-Sidorenko graphs in admissible graphon classes.