Forbidding Hamilton cycles in uniform hypergraphs

DOI10.1016/j.jcta.2016.05.005zbMath1342.05082arXiv1508.05623MaRDI QIDQ530769

Yi Zhao, Jie Han

Publication date: 1 August 2016

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

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

zbMATH Keywords

hypergraphs; perfect matchings; Hamilton cycles

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.)

05C45: Eulerian and Hamiltonian graphs

05C07: Vertex degrees