Perfect matchings in 3-partite 3-uniform hypergraphs

DOI10.1016/J.JCTA.2014.05.004MaRDI QIDQ406558zbMATH OpenOpenAlexFDO

Authors Allan Lo, Klas Markström

Publication date 8 September 2014

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

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

zbMATH Keywords

\(k\)-partitehypergraphminimum degreeperfect matching

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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.

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

Cites work

• 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
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• 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₄^3-tilings in hypergraphs of large codegree
• Perfect matchings in \(r\)-partite \(r\)-graphs
• Perfect matchings in 3-uniform hypergraphs with large vertex degree
• Perfect matchings in 4-uniform hypergraphs
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Some Theorems on Abstract Graphs
• The Factorization of Linear Graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Tight co-degree condition for perfect matchings in 4-graphs

Cited in

(20)

• \(d\)-matching in 3-uniform hypergraphs
• Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs
• From one to many rainbow Hamiltonian cycles
• Cyclic triangle factors in regular tournaments
• Perfect matchings in \(r\)-partite \(r\)-graphs
• Perfect matching of 3-uniform hypergraphs
• Permanents of multidimensional matrices: properties and applications
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• scientific article; zbMATH DE number 4065037 (Why is no real title available?)
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• Degree conditions for matchability in 3-partite hypergraphs
• Polynomial-time perfect matchings in dense hypergraphs
• A stability theorem for matchings in tripartite 3-graphs
• Unmixed \(d\)-uniform \(r\)-partite hypergraphs.
• On the numbers of 1-factors and 1-factorizations of hypergraphs
• Note on matchings in 3-partite 3-uniform hypergraphs
• An existence theorem of perfect matching on k-partite k-uniform hypergraphs via distance spectral radius
• Matchings in multipartite hypergraphs
• Packing k-partite k-uniform hypergraphs
• Perfect matchings in 4-uniform hypergraphs

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)