Matchings, Hamilton Cycles and Cycle Packings in Uniform Hypergr...

EuroComb 2005 DMTCS proc. AE, 2005, 273–278Matchings, Hamilton cycles and cycle packings in uniform hypergraphsDaniela Kühn1 and Deryk Osthus11School of Mathematics, Birmingham University, Edgbaston, Birmingham B15 2TT, UKIt is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for uniform hypergraphs. We also provide an analogue of Dirac’s theorem on Hamilton cycles for 3-unif