Ming Chen

collaborators

3 papers

math.CO2026

TurÃ¡n-type and tiling problems in oriented graphs

Ming Chen, Wenxu Lu, Yun Wang +1

Given $a, b, c \in N$ , let $D_{a, b, c}$ be the tournament on $a + b + c$ vertices obtained by replacing the vertices of the directed triangle $C_{3}$ with transitive tournaments $TT_a…

math.CO2026

On a weaker notion of cross $t$ -intersecting families

Jiangdong Ai, Ming Chen, Seokbeom Kim +1

We prove that if two families $F \subseteq (k [ n ])$ and $F^{'} \subseteq (k ^{'} [ n ])$ satisfy $\sum_{1 \leq i, j \leq \ell} \lvert F_i \cap F_j' \rvert…

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))…

TurÃ¡n-type and tiling problems in oriented graphs

On a weaker notion of cross t-intersecting families

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

On a weaker notion of cross $t$ -intersecting families

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