Library Header Image
LSE Research Online LSE Library Services

Asymptotic multipartite version of the Alon–Yuster theorem

Martin, Ryan R. and Skokan, Jozef (2017) Asymptotic multipartite version of the Alon–Yuster theorem. Journal of Combinatorial Theory, Series B, 127. pp. 32-52. ISSN 0095-8956

Text - Accepted Version
Download (590kB) | Preview

Identification Number: 10.1016/j.jctb.2017.05.004


In this paper, we prove the asymptotic multipartite version of the Alon–Yuster theorem, which is a generalization of the Hajnal–Szemerédi theorem: If k≥3 is an integer, H is a k -colorable graph and γ>0 is fixed, then, for every sufficiently large n , where |V(H)| divides n, and for every balanced k-partite graph G on kn vertices with each of its corresponding View the MathML source bipartite subgraphs having minimum degree at least (k−1)n/k+γn, G has a subgraph consisting of kn/|V(H)| vertex-disjoint copies of H. The proof uses the Regularity method together with linear programming.

Item Type: Article
Official URL:
Additional Information: © 2017 Elsevier Inc.
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Sets: Departments > Mathematics
Date Deposited: 05 Jun 2017 09:31
Last Modified: 20 Jun 2020 02:28

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics