Yiao Ju

collaborators

2 papers

math.CO2026

ErdÅs-Hajnal beyond the five-vertex path

Shenwei Huang, Yiao Ju, Yidong Zhou

The well-known ErdÅs-Hajnal conjecture states that for any graph $H$ , there is a constant $c = c (H) > 0$ such that every $n$ -vertex graph $G$ with no induced copies of $H$ contains a…

math.CO2025

There are finitely many $5$ -vertex-critical $(P_{6}, bull)$ -free graphs

Yiao Ju, Jorik Jooken, Jan Goedgebeur +1

In this paper, we are interested in $4$ -colouring algorithms for graphs that do not contain an induced path on $6$ vertices nor an induced bull, i.e., the graph with vertex set $\{…

ErdÅs-Hajnal beyond the five-vertex path

There are finitely many 5-vertex-critical (P6​,bull)-free graphs

ErdÅs-Hajnal beyond the five-vertex path

There are finitely many $5$ -vertex-critical $(P_{6}, bull)$ -free graphs