Perfect matchings in 4-uniform hypergraphs

DOI10.1016/J.JCTB.2015.09.005MaRDI QIDQ896007zbMATH OpenOpenAlexFDO

Authors Imdadullah Khan

Publication date 11 December 2015

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1101.5675

zbMATH Keywords

hypergraphsperfect matchingvertex degree

Mathematics Subject Classification ID

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

Abstract: A perfect matching in a 4-uniform hypergraph is a subset of $lfloorfracn4floor$ disjoint edges. We prove that if $H$ is a sufficiently large 4-uniform hypergraph on $n=4k$ vertices such that every vertex belongs to more than $n-1choose3-3n/4choose3$ edges then $H$ contains a perfect matching. This bound is tight and settles a conjecture of H{'a}n, Person and Schacht.

Recommendations

• Perfect matchings in 3-uniform hypergraphs with large vertex degree
• Perfect matchings in uniform hypergraphs with large minimum degree
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Rainbow perfect matchings for 4-uniform hypergraphs
• Matchings in 3-uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 5720905 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Degrees giving independent edges in a hypergraph
• Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve)
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• Matchings in 3-uniform hypergraphs
• Matchings in hypergraphs of large minimum degree
• On extremal problems of graphs and generalized graphs
• On perfect matchings in uniform hypergraphs with large minimum vertex degree
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
• Perfect matchings in 3-partite 3-uniform hypergraphs
• Perfect matchings in 3-uniform hypergraphs with large vertex degree
• Perfect matchings in \(r\)-partite \(r\)-graphs
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Perfect matchings in uniform hypergraphs with large minimum degree
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Some Theorems on Abstract Graphs

Cited in

(41)

• Packing \(k\)-partite \(k\)-uniform hypergraphs
• A note on perfect matchings in uniform hypergraphs
• Tournaments, 4-uniform hypergraphs, and an exact extremal result
• Vertex degree sums for matchings in 3-uniform hypergraphs
• Vertex degree sums for matchings in 3-uniform hypergraphs
• Improved bound on vertex degree version of Erdős matching conjecture
• Perfect matchings in 3-partite 3-uniform hypergraphs
• Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs
• Perfect packings in quasirandom hypergraphs. I.
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Dirac-type theorems in random hypergraphs
• scientific article; zbMATH DE number 5656434 (Why is no real title available?)
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• The Erdős matching conjecture and concentration inequalities
• Perfect Packings in Quasirandom Hypergraphs II
• A geometric theory for hypergraph matching
• Perfect matchings in hypergraphs and the Erdős matching conjecture
• Matching of given sizes in hypergraphs
• Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs
• Vertex degree sums for perfect matchings in 3-uniform hypergraphs
• \(d\)-matching in 3-uniform hypergraphs
• Near perfect matchings in \(k\)-uniform hypergraphs
• A condition for matchability in hypergraphs
• Co-degree threshold for rainbow perfect matchings in uniform hypergraphs
• Rainbow perfect matchings for 4-uniform hypergraphs
• \(F\)-factors in hypergraphs via absorption
• Rainbow matchings for 3-uniform hypergraphs
• On a hypergraph matching problem
• Matchings defined by local conditions
• The complexity of perfect matchings and packings in dense hypergraphs
• Polynomial-time perfect matchings in dense hypergraphs
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• On perfect matchings and tilings in uniform hypergraphs
• Matching in 3-uniform hypergraphs
• Perfect matchings in 3-uniform hypergraphs with large vertex degree
• Minimum codegree threshold for \(C_6^3\)-factors in 3-uniform hypergraphs
• Note on matchings in 3-partite 3-uniform hypergraphs
• Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
• Decision problem for perfect matchings in dense \(k\)-uniform hypergraphs
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
• On matchings in hypergraphs

This page was built for publication: Perfect matchings in 4-uniform hypergraphs

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