Donglei Yang

collaborators

8 papers

math.CO2026

Balanced clique subdivisions and cycles lengths in $K_{s, t}$ -free graphs

Jianfeng Hou, Yindong Jin, Donglei Yang +1

Let $t \geq s \geq 2$ be integers. Confirming a conjecture of Mader, Liu and Montgomery [J. Lond. Math. Soc., 2017] showed that every $K_{s, t}$ -free graph with average degree $d$ cont…

math.CO2026

Transversal tilings in k-partite graphs without large holes

Xinyu He, Xiangxiang Nie, Donglei Yang

We show that for any constant $I^¼ > 0$ and $k \geq 3$ , there exists $I^\pm > 0$ such that the following holds for sufficiently large $n \in N$ . If $G = (V_{1}, \dots, V_{k}, E)$ is a s…

math.CO2025

Clique factors in random samplings of regular graphs

Wanting Sun, Shunan Wei, Donglei Yang

We show that for any integer $r \geq 2$ , there exists a constant $c > 0$ such that for every sufficiently large integer $n$ , every $((r - 1) n + 1)$ -regular graph $G$ on $r n$ vertices has a…

math.CO2025

Dense minors and bipartite independence numbers

Xia Wang, Donglei Yang

A graph $G$ is $m$ -joined if there is an edge between every two disjoint $m$ -sets of vertices. In this paper, we prove that for any $ε > 0$ and sufficiently large $m, n\in…

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

math.CO2025

Perfect tilings with the generalised triangle in $k$ -graphs

Weichan Liu, Xiangxiang Nie, Donglei Yang +1

Denote by $T_{k}$ the generalised triangle, a $k$ -uniform hypergraph on vertex set ${1, 2, \dots, 2 k - 1}$ with three edges ${1, \dots, k - 1, k}$ , ${1, \dots, k - 1, k + 1}$ and $\{k,k+1,\dots,…

Balanced clique subdivisions and cycles lengths in Ks,t​-free graphs

Transversal tilings in k-partite graphs without large holes

Clique factors in random samplings of regular graphs

Dense minors and bipartite independence numbers

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

Perfect tilings with the generalised triangle in k-graphs

Balanced clique subdivisions and cycles lengths in $K_{s, t}$ -free graphs

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

Perfect tilings with the generalised triangle in $k$ -graphs