Perfect matchings in 3-partite 3-uniform hypergraphs

DOI10.1016/J.JCTA.2014.05.004zbMATH Open1300.05200arXiv1103.5654OpenAlexW2027878806MaRDI QIDQ406558FDOQ406558

Authors: Allan Lo, Klas Markström 

Publication date: 8 September 2014

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

Abstract: Let $H$ be a $3$-partite $3$-uniform hypergraph, i.e. a $3$-uniform hypergraph such that every edge intersects every partition class in exactly one vertex, with each partition class of size $n$. We determine a Dirac-type vertex degree threshold for perfect matchings in $3$-partite $3$-uniform hypergraphs.

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

Recommendations

• Perfect matchings in 3-uniform hypergraphs with large vertex degree
• Perfect matching of 3-uniform hypergraphs
• Matchings in 3-uniform hypergraphs
• Matching in 3-uniform hypergraphs
• Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs

zbMATH Keywords

minimum degreehypergraphperfect matching\(k\)-partite

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 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
• The Factorization of Linear Graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• 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
• 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
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• Perfect matchings in 4-uniform hypergraphs
• Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve)
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• Perfect matchings in \(r\)-partite \(r\)-graphs
• Degrees giving independent edges in a hypergraph
• Tight co-degree condition for perfect matchings in 4-graphs
• Matchings in hypergraphs of large minimum degree

Cited In (18)

• Packing \(k\)-partite \(k\)-uniform hypergraphs
• From one to many rainbow Hamiltonian cycles
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Cyclic triangle factors in regular tournaments
• Degree conditions for matchability in 3-partite hypergraphs
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• Perfect matching of 3-uniform hypergraphs
• Perfect matchings in 4-uniform hypergraphs
• Title not available (Why is that?)
• \(d\)-matching in 3-uniform hypergraphs
• Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs
• Perfect matchings in \(r\)-partite \(r\)-graphs
• Polynomial-time perfect matchings in dense hypergraphs
• Unmixed \(d\)-uniform \(r\)-partite hypergraphs.
• A stability theorem for matchings in tripartite 3-graphs
• On the numbers of 1-factors and 1-factorizations of hypergraphs
• Note on matchings in 3-partite 3-uniform hypergraphs
• Permanents of multidimensional matrices: properties and applications

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

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