2 papers
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
Kohayakawa-Nagle-R{ö}dl-Schacht conjecture for subdivisions
Hao Chen, Yupeng Lin, Jie Ma
In this paper, we study the well-known Kohayakawa-Nagle-R{ö}dl-Schacht (KNRS) conjecture, with a specific focus on graph subdivisions. The KNRS conjecture asserts that for any grap…