A path forward: Tropicalization in extremal combinatorics

Many important problems in extremal combinatorics can be stated as proving a pure binomial inequality in graph homomorphism numbers, i.e., proving that hom(H1,G)a1⋯hom(Hk,G)ak≥hom(Hk+1,G)ak+1⋯hom(Hm,G)am holds for some fixed graphs H1,…,Hm and all graphs G. One prominent example is Sidorenko's conjecture. For a fixed collection of graphs U={H1,…,Hm}, the exponent vectors of valid pure binomial inequalities in graphs of U form a convex cone. We compute this cone for several families of graphs including complete graphs, even cycles, stars and paths; the latter is the most interesting and intricate case that we compute. In all of these cases, we observe a tantalizing polyhedrality phenomenon: the cone of valid pure binomial inequalities is actually rational polyhedral, and therefore all valid pure binomial inequalities can be generated from the finite collection of exponent vectors of the extreme rays. Using the work of Kopparty and Rossman ([17]), we show that the cone of valid inequalities is indeed rational polyhedral when all graphs Hi are series-parallel and chordal, and we conjecture that polyhedrality holds for any finite collection U. We demonstrate that the polyhedrality phenomenon also occurs in matroids and simplicial complexes. Our description of the inequalities for paths involves a generalization of the Erdős-Simonovits conjecture recently proved in its original form in [29] and a new family of inequalities not observed previously. We also solve an open problem of Kopparty and Rossman on the homomorphism domination exponent of paths. One of our main tools is tropicalization, a well-known technique in complex algebraic geometry, first applied in extremal combinatorics in [3]. We prove several results about tropicalizations which may be of independent interest.