Doudou Hei

collaborators

2 papers

math.CO2022

The cycle of length four is strictly $F$ -Turán-good

Doudou Hei, Xinmin Hou

Given an $(r + 1)$ -chromatic graph $F$ and a graph $H$ that does not contain $F$ as a subgraph, we say that $H$ is strictly $F$ -Turán-good if the Turán graph $T_{r} (n)$ is the unique…

math.CO2021

Some exact results of the generalized Turán numbers for paths

Doudou Hei, Xinmin Hou, Boyuan Liu

For graphs $H$ and $F$ with chromatic number $χ (F) = k$ , we call $H$ strictly $F$ -Turán-good (or $(H, F)$ strictly Turán-good) if the Turán graph $T_{k - 1} (n)$ is the unique $F$ -free…

The cycle of length four is strictly F-Turán-good

Some exact results of the generalized Turán numbers for paths

The cycle of length four is strictly $F$ -Turán-good