Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs

DOI10.1007/978-88-7642-475-5_6zbMath1293.05308OpenAlexW332268014MaRDI QIDQ5419939

Andrew Treglown, Yi Zhao

Publication date: 11 June 2014

Published in: The Seventh European Conference on Combinatorics, Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-88-7642-475-5_6

zbMATH Keywords

decision problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• Tight co-degree condition for perfect matchings in 4-graphs
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• Perfect matchings in uniform hypergraphs with large minimum degree
• Perfect matchings in 4-uniform hypergraphs
• Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Matchings in 3-uniform hypergraphs
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
• Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• Degrees giving independent edges in a hypergraph
• Reducibility among Combinatorial Problems
• Matchings in hypergraphs of large minimum degree
• The Factorization of Linear Graphs