Hao Chen

works on

alternating cycles 1 edge-coloured graphs 1 extremal graph theory 1 flag algebras 1 random colourings 1

From the 1 of 4 linked papers with an AI index.

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

On Alternating 6-Cycles in Edge-Coloured Graphs

Hao Chen, Jonathan A. Noel

The paper shows that, for a large complete graph whose edges are coloured red or blue, the expected number of colour‑alternating 6‑cycles is largest when the colouring is chosen un…

math.CO2026

On Tournament Anti-Sidorenko Orientations of Trees

Hao Chen, Felix Christian Clemen, Jonathan A. Noel

An oriented graph $H$ is said to be tournament anti-Sidorenko if the homomorphism density of $H$ in any tournament $T$ 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 $G$ is an $n$ -vertex graph whose edges are coloured with red and blue, then the number of colour-alternating walks of length $2 k + 1$ with $k + 1$ red edges and $k$ bl…