Positive codegree thresholds for perfect matchings in hypergraphs
Authors:
Preprint
Abstract
We give, for each $k \geq 3$, the precise best possible minimum positive codegree condition for a perfect matching in a large $k$-uniform hypergraph $H$ on $n$ vertices. Specifically we show that, if $n$ is sufficiently large and divisible by $k$, and $H$ has minimum positive codegree $δ^+(H) \geq \frac{k-1}{k}n - (k-2)$ and no isolated vertices, then $H$ contains a perfect matching. For $k=3$ this was previously established by Halfpap and Magnan, who also gave bounds for $k \geq 4$ which were tight up to an additive constant.
Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Positive Co-Degree Thresholds for Spanning StructuresThe Electronic Journal of Combinatorics, 2026
- Spanning Spheres in Dirac HypergraphsCombinatorica, 2025
- Maximum Size Intersecting Families of Bounded Minimum Positive Co-degreeSIAM Journal on Discrete Mathematics, 2021
- Perfect matchings in large uniform hypergraphs with large minimum collective degreeJournal of Combinatorial Theory, Series A, 2009
- Matchings in hypergraphs of large minimum degreeJournal of Graph Theory, 2005
- Asymptotic behavior of the chromatic index for hypergraphsJournal of Combinatorial Theory, Series A, 1989
- Degrees giving independent edges in a hypergraphBulletin of the Australian Mathematical Society, 1981
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965