Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices

DOI10.1007/s10114-019-9086-xzbMath1431.05109arXiv1808.02319OpenAlexW2999953518MaRDI QIDQ2287773

Lei Yu, Xin Min Hou

Publication date: 21 January 2020

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphfactorcodegree

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Cites Work

• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Packing \(k\)-partite \(k\)-uniform hypergraphs
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Forbidding just one intersection
• Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles
• Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
• Tiling 3-Uniform Hypergraphs With K43−2e
• Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles

This page was built for publication: Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices