Sidorenko’s conjecture for subdivisions and theta substitutions
Open Access
- 10 December 2025
- journal article
- research article
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 35 (2) , 269-279
Abstract
The famous Sidorenko’s conjecture asserts that for every bipartite graph $H$ , the number of homomorphisms from $H$ to a graph $G$ with given edge density is minimised when $G$ is pseudorandom. We prove that for any graph $H$ , a graph obtained from replacing edges of $H$ by generalised theta graphs consisting of even paths satisfies Sidorenko’s conjecture, provided a certain divisibility condition on the number of paths. To achieve this, we prove unconditionally that bipartite graphs obtained from replacing each edge of a complete graph with a generalised theta graph satisfy Sidorenko’s conjecture, which extends a result of Conlon, Kim, Lee and Lee [J. Lond. Math. Soc., 2018].
Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Common graphs with arbitrary chromatic numberCompositio Mathematica, 2025
- On some graph densities in locally dense graphsRandom Structures & Algorithms, 2020
- Some advances on Sidorenko's conjectureJournal of the London Mathematical Society, 2018
- Two approaches to Sidorenko’s conjectureTransactions of the American Mathematical Society, 2015
- Counting odd cycles in locally dense graphsJournal of Combinatorial Theory, Series B, 2014
- An Approximate Version of Sidorenko’s ConjectureGeometric and Functional Analysis, 2010
- Weak hypergraph regularity and linear hypergraphsJournal of Combinatorial Theory, Series B, 2010
- Graph norms and Sidorenko’s conjectureIsrael Journal of Mathematics, 2010
- A correlation inequality for bipartite graphsGraphs and Combinatorics, 1993
- Quasi-random graphsCombinatorica, 1989