Positive codegree thresholds for perfect matchings in hypergraphs

DOI10.1137/25M1763056MaRDI QIDQ7308587zbMATH OpenFDO

Authors Richard Mycroft, Camila Zárate-Guerén

Publication date 4 August 2026

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/25M1763056

Mathematics Subject Classification ID

Vertex degrees (05C07) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• Asymptotic behavior of the chromatic index for hypergraphs
• Degrees giving independent edges in a hypergraph
• Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve)
• Embedding large subgraphs into dense graphs
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Matchings in hypergraphs of large minimum degree
• Maximum size intersecting families of bounded minimum positive co-degree
• On Representatives of Subsets
• Paths, Trees, and Flowers
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Positive co-degree thresholds for spanning structures
• Recent advances on Dirac-type problems for hypergraphs
• Reducibility among combinatorial problems
• Spanning spheres in Dirac hypergraphs
• The Factorization of Linear Graphs

This page was built for publication: Positive codegree thresholds for perfect matchings in hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7308587)