4 papers · 1 filter
Oriented Paths with Few Direction Flips Are Tournament Anti-Sidorenko
Hao Chen, Yupeng Lin
An oriented graph is said to be tournament anti-Sidorenko (TAS) if a uniformly random tournament asymptotically maximizes the homomorphism density of among all tournaments.…
A Hypergraph Container Method for Spread SAT: Approximation and Speedup
Zicheng Han, Yupeng Lin, Jie Ma +1
We develop a hypergraph container method for the Boolean Satisfiability Problem (SAT) via the newly developed container results [Campos and Samotij (2026)]. This provides an explic…
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…
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…