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

DOI10.1007/s10255-020-0962-zzbMath1462.05295OpenAlexW3082561465MaRDI QIDQ2023735

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

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

• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• Perfect matchings in uniform hypergraphs with large minimum degree
• A note on perfect matchings in uniform hypergraphs
• A condition for matchability in hypergraphs
• Matchings in 3-uniform hypergraphs
• The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
• Perfect matchings in \(r\)-partite \(r\)-graphs
• On Hamilton's ideals
• Perfect matchings in balanced hypergraphs
• Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• Reducibility among Combinatorial Problems
• Paths, Trees, and Flowers
• Near Perfect Matchings ink-Uniform Hypergraphs
• Matchings in hypergraphs of large minimum degree
• The Factorization of Linear Graphs

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