Goodman-type lower bounds for graph homomorphism densities
Taeyoung Kim
math.CO
Nov 13, 2026 · v1
TL;DR
Main theorems, the 117-graph classification, counterexamples, and density-range table are formally verified in Lean 4 with Mathlib, with AI assistance.
Abstract
For a finite graph $H$ with $v(H)$ vertices, chromatic number $χ(H)$, and chromatic polynomial $P_H$, define $Φ_H(p)=(1-p)^{v(H)}P_H((1-p)^{-1})$. This polynomial interpolates the homomorphism densities of $H$ in balanced complete multipartite graphons. We study the lower bound $t(H,W)\geΦ_H(p)$ on the homomorphism density of $H$ in graphons $W$ of edge density $p>1-1/(χ(H)-1)$, which generalises Goodman's triangle bound. We prove the inequality for chordal graphs whose maximal cliques have equal size, for trivially perfect graphs, and for joins of a clique and an odd cycle. The proofs use entropy along clique trees and a convexity criterion for adding a universal vertex. We also prove that a nonbipartite graph satisfies the inequality at all sufficiently high edge densities if and only if its girth is odd. For a graph on $n$ vertices whose girth is odd, the bound holds whenever $p>1-(72n^{12})^{-1}$. The proof combines Whitney's forest expansion with a spectral comparison of cycle densities. Finally, among the $117$ nonbipartite graphs on at most six vertices with no isolated vertices or isolated edges, exactly $94$ satisfy the bound. The main results are formally verified in Lean 4.
Problem
For a graph H, define Φ_H(p) from its chromatic polynomial. This polynomial interpolates homomorphism densities in balanced complete multipartite graphons. The question is which graphs satisfy t(H,W) ≥ Φ_H(p) for graphons of edge density above 1−1/(χ(H)−1), a generalisation of Goodman's triangle bound.
Approach
The bound is proved for chordal graphs with equal-size maximal cliques, using entropy along clique trees. A convexity criterion for adding a universal vertex handles trivially perfect graphs and joins of a clique with an odd cycle. Eventual validity at high density combines Whitney's forest expansion with a spectral comparison of cycle densities. All 117 small graphs are classified by case-wise proofs or step-graphon counterexamples. The results are formalized in Lean 4/Mathlib, and the formalization was carried out with Claude models.
Results
A nonbipartite graph satisfies the bound at all sufficiently high densities if and only if its girth is odd; for such graphs it holds when p > 1−(72n^12)^{-1}. Exactly 94 of the 117 small graphs satisfy the bound. The main results are machine-checked in a public Lean repository.