Let ${\displaystyle H}$  be a graph. Then ${\displaystyle H}$  is said to have Sidorenko's property if, for all graphons ${\displaystyle W}$ , the inequality

${\displaystyle t(H,W)\geq t(K_{2},W)^{|E(H)|}}$ 

is true, where ${\displaystyle t(H,W)}$  is the homomorphism density of ${\displaystyle H}$  in ${\displaystyle W}$ .

Sidorenko's conjecture (1986) states that every bipartite graph has Sidorenko's property.^[1]

If ${\displaystyle W}$  is a graph ${\displaystyle G}$ , this means that the probability of a uniform random mapping from ${\displaystyle V(H)}$  to ${\displaystyle V(G)}$  being a homomorphism is at least the product over each edge in ${\displaystyle H}$  of the probability of that edge being mapped to an edge in ${\displaystyle G}$ . This roughly means that a randomly chosen graph with fixed number of vertices and average degree has the minimum number of labeled copies of ${\displaystyle H}$ . This is not a surprising conjecture because the right hand side of the inequality is the probability of the mapping being a homomorphism if each edge map is independent. So one should expect the two sides to be at least of the same order. The natural extension to graphons would follow from the fact that every graphon is the limit point of some sequence of graphs.

The requirement that ${\displaystyle H}$  is bipartite to have Sidorenko's property is necessary — if ${\displaystyle W}$  is a bipartite graph, then ${\displaystyle t(K_{3},W)=0}$  since ${\displaystyle W}$  is triangle-free. But ${\displaystyle t(K_{2},W)}$  is twice the number of edges in ${\displaystyle W}$ , so Sidorenko's property does not hold for ${\displaystyle K_{3}}$ . A similar argument shows that no graph with an odd cycle has Sidorenko's property. Since a graph is bipartite if and only if it has no odd cycles, this implies that the only possible graphs that can have Sidorenko's property are bipartite graphs.

Equivalent formulation edit

Sidorenko's property is equivalent to the following reformulation:

For all graphs ${\displaystyle G}$ , if ${\displaystyle G}$  has ${\displaystyle n}$  vertices and an average degree of ${\displaystyle pn}$ , then ${\displaystyle t(H,G)\geq p^{|E(H)|}}$ .

This is equivalent because the number of homomorphisms from ${\displaystyle K_{2}}$  to ${\displaystyle G}$  is twice the number of edges in ${\displaystyle G}$ , and the inequality only needs to be checked when ${\displaystyle W}$  is a graph as previously mentioned.

In this formulation, since the number of non-injective homomorphisms from ${\displaystyle H}$  to ${\displaystyle G}$  is at most a constant times ${\displaystyle n^{|V(H)|-1}}$ , Sidorenko's property would imply that there are at least ${\displaystyle (p^{|E(H)|}-o(1))n^{|V(H)|}}$  labeled copies of ${\displaystyle H}$  in ${\displaystyle G}$ .

As previously noted, to prove Sidorenko's property it suffices to demonstrate the inequality for all graphs ${\displaystyle G}$ . Throughout this section, ${\displaystyle G}$  is a graph on ${\displaystyle n}$  vertices with average degree ${\displaystyle pn}$ . The quantity ${\displaystyle \operatorname {hom} (H,G)}$  refers to the number of homomorphisms from ${\displaystyle H}$  to ${\displaystyle G}$ . This quantity is the same as ${\displaystyle n^{|V(H)|}t(H,G)}$ .

Elementary proofs of Sidorenko's property for some graphs follow from the Cauchy–Schwarz inequality or Hölder's inequality. Others can be done by using spectral graph theory, especially noting the observation that the number of closed paths of length ${\displaystyle \ell }$  from vertex ${\displaystyle i}$  to vertex ${\displaystyle j}$  in ${\displaystyle G}$  is the component in the ${\displaystyle i}$ th row and ${\displaystyle j}$ th column of the matrix ${\displaystyle A^{\ell }}$ , where ${\displaystyle A}$  is the adjacency matrix of ${\displaystyle G}$ .

Cauchy–Schwarz: The 4-cycle C₄ edit

By fixing two vertices ${\displaystyle u}$  and ${\displaystyle v}$  of ${\displaystyle G}$ , each copy of ${\displaystyle C_{4}}$  that have ${\displaystyle u}$  and ${\displaystyle v}$  on opposite ends can be identified by choosing two (not necessarily distinct) common neighbors of ${\displaystyle u}$  and ${\displaystyle v}$ . Letting ${\displaystyle \operatorname {codeg} (u,v)}$  denote the codegree of ${\displaystyle u}$  and ${\displaystyle v}$  (i.e. the number of common neighbors), this implies:

${\displaystyle \operatorname {hom} (C_{4},G)=\sum _{u,v\in V(G)}\operatorname {codeg} (u,v)^{2}\geq {\frac {1}{n^{2}}}\left(\sum _{u,v\in V(G)}\operatorname {codeg} (u,v)\right)^{2}}$ 

by the Cauchy–Schwarz inequality. The sum has now become a count of all pairs of vertices and their common neighbors, which is the same as the count of all vertices and pairs of their neighbors. So:

${\displaystyle \operatorname {hom} (C_{4},G)\geq {\frac {1}{n^{2}}}\left(\sum _{x\in V(G)}\deg(x)^{2}\right)^{2}\geq {\frac {1}{n^{2}}}\left({\frac {1}{n}}\left(\sum _{x\in V(G)}\deg(x)\right)^{2}\right)^{2}={\frac {1}{n^{2}}}\left({\frac {1}{n}}(n\cdot pn)^{2}\right)^{2}=p^{4}n^{4}}$ 

by Cauchy–Schwarz again. So:

${\displaystyle t(C_{4},G)={\frac {\operatorname {hom} (C_{4},G)}{n^{4}}}\geq p^{4}}$ 

as desired.

Spectral graph theory: The 2k-cycle C_2k edit

Although the Cauchy–Schwarz approach for ${\displaystyle C_{4}}$  is elegant and elementary, it does not immediately generalize to all even cycles. However, one can apply spectral graph theory to prove that all even cycles have Sidorenko's property. Note that odd cycles are not accounted for in Sidorenko's conjecture because they are not bipartite.

Using the observation about closed paths, it follows that ${\displaystyle \operatorname {hom} (C_{2k},G)}$  is the sum of the diagonal entries in ${\displaystyle A^{2k}}$ . This is equal to the trace of ${\displaystyle A^{2k}}$ , which in turn is equal to the sum of the ${\displaystyle 2k}$ th powers of the eigenvalues of ${\displaystyle A}$ . If ${\displaystyle \lambda _{1}\geq \lambda _{2}\geq \dots \geq \lambda _{n}}$  are the eigenvalues of ${\displaystyle A}$ , then the min-max theorem implies that:

${\displaystyle \lambda _{1}\geq {\frac {\mathbf {1} ^{\intercal }A\mathbf {1} }{\mathbf {1} ^{\intercal }\mathbf {1} }}={\frac {1}{n}}\sum _{x\in V(G)}\deg(x)=pn,}$ 

where ${\displaystyle \mathbf {1} }$  is the vector with ${\displaystyle n}$  components, all of which are ${\displaystyle 1}$ . But then:

${\displaystyle \operatorname {hom} (C_{2k},G)=\sum _{i=1}^{n}\lambda _{i}^{2k}\geq \lambda _{1}^{2k}\geq p^{2k}n^{2k}}$ 

because the eigenvalues of a real symmetric matrix are real. So:

${\displaystyle t(C_{2k},G)={\frac {\operatorname {hom} (C_{2k},G)}{n^{2k}}}\geq p^{2k}}$ 

as desired.

Entropy: Paths of length 3 edit

J.L. Xiang Li and Balázs Szegedy (2011) introduced the idea of using entropy to prove some cases of Sidorenko's conjecture. Szegedy (2015) later applied the ideas further to prove that an even wider class of bipartite graphs have Sidorenko's property.^[2] While Szegedy's proof wound up being abstract and technical, Tim Gowers and Jason Long reduced the argument to a simpler one for specific cases such as paths of length ${\displaystyle 3}$ .^[3] In essence, the proof chooses a nice probability distribution of choosing the vertices in the path and applies Jensen's inequality (i.e. convexity) to deduce the inequality.

Here is a list of some bipartite graphs ${\displaystyle H}$  which have been shown to have Sidorenko's property. Let ${\displaystyle H}$  have bipartition ${\displaystyle A\sqcup B}$ .

• Paths have Sidorenko's property, as shown by Mulholland and Smith in 1959 (before Sidorenko formulated the conjecture).^[4]
• Trees have Sidorenko's property, generalizing paths. This was shown by Sidorenko in a 1991 paper.^[5]
• Cycles of even length have Sidorenko's property as previously shown. Sidorenko also demonstrated this in his 1991 paper.
• Complete bipartite graphs have Sidorenko's property. This was also shown in Sidorenko's 1991 paper.
• Bipartite graphs with ${\displaystyle \min\{|A|,|B|\}\leq 4}$  have Sidorenko's property. This was also shown in Sidorenko's 1991 paper.
• Hypercube graphs (generalizations of ${\displaystyle Q_{3}}$ ) have Sidorenko's property, as shown by Hatami in 2008.^[6]
  • More generally, norming graphs (as introduced by Hatami) have Sidorenko's property.
• If there is a vertex in ${\displaystyle A}$  that is neighbors with every vertex in ${\displaystyle B}$  (or vice versa), then ${\displaystyle H}$  has Sidorenko's property as shown by Conlon, Fox, and Sudakov in 2010.^[7] This proof used the dependent random choice method.
• For all bipartite graphs ${\displaystyle H}$ , there is some positive integer ${\displaystyle p}$  such that the ${\displaystyle p}$ -blow-up of ${\displaystyle B}$  has Sidorenko's property. Here, the ${\displaystyle p}$ -blow-up of ${\displaystyle H}$  is formed by replacing each vertex in ${\displaystyle B}$  with ${\displaystyle p}$  copies of itself, each connected with its original neighbors in ${\displaystyle A}$ . This was shown by Conlon and Lee in 2018.^[8]
• Some recursive approaches have been attempted, which take a collection of graphs that have Sidorenko's property to create a new graph that has Sidorenko's property. The main progress in this manner was done by Sidorenko in his 1991 paper, Li and Szegedy in 2011,^[9] and Kim, Lee, and Lee in 2013.^[10]
  • Li and Szegedy's paper also used entropy methods to prove the property for a class of graphs called "reflection trees."
  • Kim, Lee, and Lee's paper extended this idea to a class of graphs with a tree-like substructure called "tree-arrangeable graphs."

However, there are graphs for which Sidorenko's conjecture is still open. An example is the "Möbius strip" graph ${\displaystyle K_{5,5}\setminus C_{10}}$ , formed by removing a ${\displaystyle 10}$ -cycle from the complete bipartite graph with parts of size ${\displaystyle 5}$ .

László Lovász proved a local version of Sidorenko's conjecture, i.e. for graphs that are "close" to random graphs in a sense of cut norm.^[11]

A sequence of graphs ${\displaystyle \{G_{n}\}_{n=1}^{\infty }}$  is called quasi-random with density ${\displaystyle p}$  for some density ${\displaystyle 0<p<1}$  if for every graph ${\displaystyle H}$ :

${\displaystyle t(H,G_{n})=(1+o(1))p^{|E(H)|}.}$ 

The sequence of graphs would thus have properties of the Erdős–Rényi random graph ${\displaystyle G(n,p)}$ .

If the edge density ${\displaystyle t(K_{2},G_{n})}$  is fixed at ${\displaystyle (1+o(1))p}$ , then the condition implies that the sequence of graphs is near the equality case in Sidorenko's property for every graph ${\displaystyle H}$ .

From Chung, Graham, and Wilson's 1989 paper about quasi-random graphs, it suffices for the ${\displaystyle C_{4}}$  count to match what would be expected of a random graph (i.e. the condition holds for ${\displaystyle H=C_{4}}$ ).^[12] The paper also asks which graphs ${\displaystyle H}$  have this property besides ${\displaystyle C_{4}}$ . Such graphs are called forcing graphs as their count controls the quasi-randomness of a sequence of graphs.

The forcing conjecture states the following:

A graph ${\displaystyle H}$  is forcing if and only if it is bipartite and not a tree.

It is straightforward to see that if ${\displaystyle H}$  is forcing, then it is bipartite and not a tree. Some examples of forcing graphs are even cycles (shown by Chung, Graham, and Wilson). Skokan and Thoma showed that all complete bipartite graphs that are not trees are forcing.^[13]

Sidorenko's conjecture for graphs of density ${\displaystyle p}$  follows from the forcing conjecture. Furthermore, the forcing conjecture would show that graphs that are close to equality in Sidorenko's property must satisfy quasi-randomness conditions.^[14]

• Common graph