2 citations · 2 across the 13 of their papers we have counts for
1 paper · 1 filter
Grigoriy Blekherman, Annie Raymond
Many important problems in extremal combinatorics can be be stated as proving a pure binomial inequality in graph homomorphism numbers, i.e., proving that hom(H1,G)a1⋯h…