Doudou Hei

activity

20212025

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

Minimizing the number of matchings of fixed size in a $K_{s}$ -saturated graph

Jiejing Feng, Doudou Hei, Xinmin Hou

For a fixed graph $F$ , a graph $G$ is said to be $F$ -saturated if $G$ does not contain a subgraph isomorphic to $F$ but does contain $F$ after the addition of any new edge. Let $M_…

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…

Minimizing the number of matchings of fixed size in a Ks​-saturated graph

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

Minimizing the number of matchings of fixed size in a $K_{s}$ -saturated graph

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