3 papers
math.CO2026
On Tournament Anti-Sidorenko Orientations of Trees
Hao Chen, Felix Christian Clemen, Jonathan A. Noel
An oriented graph is said to be tournament anti-Sidorenko if the homomorphism density of in any tournament is bounded above by the homomorphism densit…
math.CO2025
Maximizing Alternating Paths via Entropy
Hao Chen, Felix Christian Clemen, Jonathan A. Noel
We prove that if is an -vertex graph whose edges are coloured with red and blue, then the number of colour-alternating walks of length with red edges and bl…
math.CO2025
On Alternating 6-Cycles in Edge-Coloured Graphs
Hao Chen, Jonathan A. Noel
In this short note, we use flag algebras to prove that the number of colour alternating 6-cycles in a red/blue colouring of a large clique is asymptotically maximized by a uniforml…