activity
20242026
collaborators

10 papers

math.CO2026

Transversal tilings in k-partite graphs without large holes

Xinyu He, Xiangxiang Nie, Donglei Yang

We show that for any constant and , there exists such that the following holds for sufficiently large . If is a spa…

math.CO2025

Clique factors in random samplings of regular graphs

Wanting Sun, Shunan Wei, Donglei Yang

We show that for any integer , there exists a constant such that for every sufficiently large integer , every -regular graph on vertices has a…

math.CO2025

Dense minors and bipartite independence numbers

Xia Wang, Donglei Yang

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

math.CO2025

Clique-factors in graphs with low -independence number

Ming Chen, Jie Han, Donglei Yang

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

math.CO2025

Perfect tilings with the generalised triangle in -graphs

Weichan Liu, Xiangxiang Nie, Donglei Yang +1

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

math.CO2025

Transversal packings in families of percolated hypergraphs

Jie Han, Jie Hu, Shunan Wei +1

Let be a strictly -balanced -graph on vertices with edges and be the infimum of such that for every and sufficiently large $n\in \mathbb{N…

math.CO2025

Packing tetrahedrons in edge-weighted graphs

Wanting Sun, Shunan Wei, Donglei Yang

We prove that for all and sufficiently large , if is an edge-weighted complete graph on vertices with a weight function $w: E(G)\rightar…

math.CO2024

Topological cliques in sparse expanders

Xia Wang, Donglei Yang, Fan Yang +1

In the paper, we focus on embedding clique immersions and subdivisions within sparse expanders, and we derive the following main results: (1) For any , there exists $K>0…

math.CO2024

Balanced clique subdivisions and cycles lengths in -free graphs

Jianfeng Hou, Yindong Jin, Donglei Yang +1

Let be integers. Confirming a conjecture of Mader, Liu and Montgomery [J. Lond. Math. Soc., 2017] showed that every -free graph with average degree cont…

math.CO2024

Embedding clique subdivisions via crux

Donglei Yang, Fan Yang

For a graph and a constant , we denote by the minimum order of a subgraph with . Liu and Montgomery conjectured that every graph …