English

Transversal tilings in k-partite graphs without large holes

Combinatorics 2026-02-12 v1

Abstract

We show that for any constant μ>0\mu>0 and k3k\ge 3, there exists α>0\alpha>0 such that the following holds for sufficiently large nNn \in \mathbb{N}. If G=(V1,,Vk,E)G=(V_{1},\ldots,V_{k},E) is a spanning subgraph of the nn-blow-up of KkK_{k} with δ(G)(12+μ)n{\delta^*}(G)\geq (\frac{1}{2}+\mu) n and αk1(G)<αn\alpha^*_{k-1}(G)<\alpha n, then GG has a transversal KkK_{k}-factor. Moreover, the bound 12\frac{1}{2} is asymptotically tight for the case k=3k=3. In addition, we show that if k4k\ge 4, G=(V1,,Vk,E)G=(V_{1},\ldots,V_{k},E) is a spanning subgraph of the nn-blow-up of CkC_{k} with δ(G)(2k+μ)n{\delta^*}(G)\ge (\frac{2}{k}+\mu) n, and α2(G)<αn\alpha^*_{2}(G)<\alpha n, then GG has a transversal CkC_{k}-factor. This extends a recent result of Han, Hu, Ping, Wang, Wang and Yang.

Keywords

Cite

@article{arxiv.2602.10578,
  title  = {Transversal tilings in k-partite graphs without large holes},
  author = {Xinyu He and Xiangxiang Nie and Donglei Yang},
  journal= {arXiv preprint arXiv:2602.10578},
  year   = {2026}
}