A counterexample to Sidorenko's conjecture
Let be the incidence graph of the 22 triples on 13 points in Table 1, which is a bipartite graph with 35 vertices and 66 edges. There is a finite simple undirected graph with at least one edge such that , disproving Sidorenko's conjecture.
The proof chain from the explicit complex in Table 1 through the rank-layer limit (Lemma 3.1), symmetric kernel construction (Proposition 3.5), and finite-host sampling (Lemma 3.6) is complete and logically sound.
“Theorem 1.1. Let H be the incidence graph of the 22 triples on 13 points in Table 1. This bipartite graph has 35 vertices and 66 edges. There is a finite simple undirected graph G with at least one edge such that t(H, G) < p(G)^66.” · Show in paper