WorksMathematics
Ore-degree conditions for matchings in uniform hypergraphs
Abstract
Let be the minimum sum of vertex degrees over all nonedges of an -uniform hypergraph on vertices. Balogh, Palmer and Raeisi conjectured that and imply the existence of a matching of size in . We prove that, for every fixed and all sufficiently large , forces an -matching whenever . A complete -graph on vertices together with isolated vertices shows that the vertex bound is sharp for all sufficiently large . By adding new vertices to , retaining all its edges, and adding every -set containing at least one new vertex as an edge, we also deduce that suffices under the same degree condition for every , where is a finite constant depending only on . For , we provide the explicit sufficient order for , together with bounds for , establishing the conjecture in this uniformity. For , we improve the known sufficient order to for every and show that this order is best possible.