Ming Chen

activity

20222025

collaborators

3 papers

math.CO2025

Clique-factors in graphs with low $K_{ℓ}$ -independence number

Ming Chen, Jie Han, Donglei Yang

Given $r \in N$ with $r \geq 4$ , we show that there exists $n_{0} \in N$ such that for every $n \geq n_{0}$ , every $n$ -vertex graph $G$ with $δ(G)\geq (\frac{1}{2}+o(1))n…

math.CO2023

On powers of Hamilton cycles in Ramsey-Turán Theory

Ming Chen, Jie Han, Yantao Tang +1

We prove that for $r \in N$ with $r \geq 2$ and $μ > 0$ , there exist $α > 0$ and $n_{0}$ such that for every $n \geq n_{0}$ , every $n$ -vertex graph $G$ with $δ(G)\geq \left(1-\fr…

math.CO2022

$H$ -factors in graphs with small independence number

Ming Chen, Jie Han, Guanghui Wang +1

Let $H$ be an $h$ -vertex graph. The vertex arboricity $a r (H)$ of $H$ is the least integer $r$ such that $V (H)$ can be partitioned into $r$ parts and each part induces a forest in $…

Clique-factors in graphs with low Kℓ​-independence number

On powers of Hamilton cycles in Ramsey-Turán Theory

H-factors in graphs with small independence number

Clique-factors in graphs with low $K_{ℓ}$ -independence number

$H$ -factors in graphs with small independence number