Perfect matchings in 4-uniform hypergraphs

DOI10.1016/J.JCTB.2015.09.005zbMATH Open1327.05274arXiv1101.5675OpenAlexW1545514328MaRDI QIDQ896007FDOQ896007

Imdadullah Khan

Publication date: 11 December 2015

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

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.

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

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

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)

Cites Work

• Title not available (Why is that?)
• On extremal problems of graphs and generalized graphs
• Title not available (Why is that?)
• Some Theorems on Abstract Graphs
• 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
• Perfect matchings in 3-uniform hypergraphs with large vertex degree
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Title not available (Why is that?)
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• Title not available (Why is that?)
• Perfect matchings in uniform hypergraphs with large minimum degree
• Perfect matchings in \(r\)-partite \(r\)-graphs
• Degrees giving independent edges in a hypergraph
• Perfect matchings in 3-partite 3-uniform hypergraphs
• Matchings in hypergraphs of large minimum degree

Cited In (39)

• Vertex degree sums for matchings in 3-uniform hypergraphs
• Packing \(k\)-partite \(k\)-uniform hypergraphs
• A note on perfect matchings in uniform hypergraphs
• Near Perfect Matchings ink-Uniform Hypergraphs
• Rainbow Perfect Matchings for 4-Uniform Hypergraphs
• Vertex degree sums for matchings in 3-uniform hypergraphs
• Improved bound on vertex degree version of Erdős matching conjecture
• Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs
• Perfect matchings in 3-partite 3-uniform hypergraphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Dirac-type theorems in random hypergraphs
• Title not available (Why is that?)
• Perfect packings in quasirandom hypergraphs. I.
• Perfect Packings in Quasirandom Hypergraphs II
• On Perfect Matchings and Tilings in Uniform Hypergraphs
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• The Erdős matching conjecture and concentration inequalities
• A geometric theory for hypergraph matching
• 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
• Co-degree threshold for rainbow perfect matchings in uniform hypergraphs
• A condition for matchability in hypergraphs
• Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs
• \(F\)-factors in hypergraphs via absorption
• Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
• 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
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• Polynomial-time perfect matchings in dense hypergraphs
• Matching in 3-uniform hypergraphs
• Fractional and integer matchings in uniform hypergraphs
• Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
• Note on matchings in 3-partite 3-uniform hypergraphs
• Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
• Matching of Given Sizes in Hypergraphs
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs

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)