Paper Info
Title
Asymptotic multipartite version of the Alon-Yuster theorem
Abstract
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 (k2) 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.
Year
DOI
Venue
2017
10.1016/j.jctb.2017.05.004
Journal of Combinatorial Theory, Series B
Keywords
Field
DocType
Tiling,Hajnal–Szemerédi,Alon–Yuster,Multipartite,Regularity,Linear programming
Integer,Discrete mathematics,Graph,Combinatorics,Multipartite,Vertex (geometry),Bipartite graph,Linear programming,Mathematics
Journal
Volume
ISSN
Citations 
127
0095-8956
3
PageRank 
References 
Authors
0.51
17
2
Name
Order
Citations
PageRank
Ryan R. Martin13610.12
Jozef Skokan225126.55