Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs

DOI10.1016/j.jcta.2017.02.003zbMath1358.05070arXiv1503.08730MaRDI QIDQ516075

Yi Zhao, Jie Han, Chuanyun Zang

Publication date: 20 March 2017

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.08730

zbMATH Keywords

hypergraph; regularity lemma; absorbing method; graph packing

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C65: Hypergraphs

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C07: Vertex degrees