Showing 2024Show all
2 papers · 1 filter
math.CO2024
Undecidability of polynomial inequalities in tournaments
Hao Chen, Yupeng Lin, Jie Ma +1
Many fundamental problems in extremal combinatorics are equivalent to proving certain polynomial inequalities in graph homomorphism densities. In 2011, a breakthrough result by Hat…
math.CO2024
Extremal number of cliques of given orders in graphs with a forbidden clique minor
Ruilin Shi, Fan Wei
Alon and Shikhelman initiated the systematic study of a generalization of the extremal function. Motivated by algorithmic applications, the study of the extremal function $\text{ex…