Perfect matching in k-partite k-graphs and 3-uniform HM-bipartite hypergraphs

DOI10.1007/S10255-020-0962-ZzbMATH Open1462.05295OpenAlexW3082561465MaRDI QIDQ2023735FDOQ2023735

Authors: Chunqiu Fang, Mei Lu 

Publication date: 3 May 2021

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-020-0962-z

Recommendations

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

zbMATH Keywords

perfect matching\(k\)-partite \(k\)-graphHM-bipartite hypergraph

Mathematics Subject Classification ID

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

Cites Work

• Reducibility among combinatorial problems
• On Hamilton's ideals
• Paths, Trees, and Flowers
• The Factorization of Linear Graphs
• 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
• Perfect matchings in balanced hypergraphs
• The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
• Near perfect matchings in \(k\)-uniform hypergraphs
• Perfect matchings in uniform hypergraphs with large minimum degree
• A condition for matchability in hypergraphs
• Perfect matchings in \(r\)-partite \(r\)-graphs
• Matchings in hypergraphs of large minimum degree
• A note on perfect matchings in uniform hypergraphs

Cited In (12)

• Perfect matchings in 3-partite 3-uniform hypergraphs
• Perfect matching of 3-uniform hypergraphs
• On perfect \(k\)-matchings
• Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs
• Perfect matchings in \(r\)-partite \(r\)-graphs
• Unmixed \(d\)-uniform \(r\)-partite hypergraphs.
• Matchings in \(k\)-partite \(k\)-uniform hypergraphs
• Perfect matchings in balanced hypergraphs---a combinatorial approach
• A generalization of Hall's theorem for \(k\)-uniform \(k\)-partite hypergraphs
• An existence theorem of perfect matching on \(k\)-partite \(k\)-uniform hypergraphs via distance spectral radius
• Minimum codegree condition for perfect matchings in k‐partite k‐graphs
• Perfect matching and Hamilton tight cycle decomposition of complete \(n\)-balanced \(r\)-partite \(k\)-uniform hypergraphs

This page was built for publication: Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs

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