A very short proof of Sidorenko's inequality for counts of homomorphism between graphs
Abstract
We provide a very elementary proof of a classical extremality result due to Sidorenko (Discrete Math. 131.1-3, 1994), which states that among all connected graphs G on k vertices, the k-vertex star maximises the number of graph homomorphisms of G into any graph H.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.