Matchings in hypergraphs via Ore-degree conditions
This paper establishes new Ore-degree conditions that guarantee the existence of matchings in -uniform hypergraphs by proving upper bounds on the Ore-degree for intersecting hypergraphs and demonstrating that exceeding a specific threshold ensures the presence of pairwise disjoint edges.