Positive Codegree Thresholds for Perfect Matchings in Hypergraphs
SIAM Journal on Discrete Mathematics · 30.09.2026 · 40 (3) · 1229-1238
DOI: 10.1137/25m1763056 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Discrete Mathematics, online erschienen am 27.07.2026. Verfasst von Richard Mycroft und 1 weiteren Autor:innen. Die Arbeit nennt 17 Literaturangaben. Gefördert von: Engineering and Physical Sciences Research Council.
Abstract (Originalsprache)
We give, for each [Formula: see text], the precise best possible minimum positive codegree condition for a perfect matching in a large [Formula: see text]-uniform hypergraph [Formula: see text] on [Formula: see text] vertices. Specifically, we show that if [Formula: see text] is sufficiently large and divisible by [Formula: see text] and [Formula: see text] has minimum positive codegree [Formula: see text] and no isolated vertices, then [Formula: see text] contains a perfect matching. For [Formula: see text], this was previously established by Halfpap and Magnan [ Positive Co-Degree Thresholds for Spanning Structures, 2024], who also gave bounds for [Formula: see text] which were tight up to an additive constant.
Förderung
- Engineering and Physical Sciences Research Council
Zitieren
APA
Mycroft, R., & Zárate-Guerén, C. (2026). Positive Codegree Thresholds for Perfect Matchings in Hypergraphs. SIAM Journal on Discrete Mathematics, 40(3), 1229-1238. https://doi.org/10.1137/25m1763056
Vancouver
Mycroft R, Zárate-Guerén C. Positive Codegree Thresholds for Perfect Matchings in Hypergraphs. SIAM Journal on Discrete Mathematics. 2026;40(3):1229-1238. doi:10.1137/25m1763056
BibTeX
@article{Mycroft2026,
author = {Mycroft, Richard and Zárate-Guerén, Camila},
title = {Positive Codegree Thresholds for Perfect Matchings in Hypergraphs},
journal = {SIAM Journal on Discrete Mathematics},
year = {2026},
volume = {40},
number = {3},
pages = {1229--1238},
doi = {10.1137/25m1763056}
}
EUVIMED