From the 1 of 4 linked papers with an AI index.
4 papers
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…
Coloring-allowed Invariants and the 4-phases Functions of Knotoids
Haocong Chen, Jiacheng An, Fengling Li
In recent years, numerous polynomial invariants of knotoids have been constructed, some of which are defined with the signs of the crossings. In this paper, the coloring-allowed in…
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…
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…