2 papers
math.CO2022
Undecidability of polynomial inequalities in weighted graph homomorphism densities
Grigoriy Blekherman, Annie Raymond, Fan Wei
Many problems and conjectures in extremal combinatorics concern polynomial inequalities between homomorphism densities of graphs where we allow edges to have real weights. Using th…
math.CO2016
The Turán Polytope
Annie Raymond
The Turán hypergraph problem asks to find the maximum number of -edges in a -uniform hypergraph on vertices that does not contain a clique of size . When , i.e.,…