An existence theorem of perfect matching on k-partite k-uniform hypergraphs via distance spectral radius

DOI10.22108/TOC.2023.137937.2077MaRDI QIDQ6202541FDO

Authors Lei Zhang, Haizhen Ren

Publication date 26 February 2024

zbMATH Keywords

perfect matchingdistance spectral radius\(k\)-uniform \(k\)-partite hypergraphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65)

Recommendations

• Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs
• Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs
• Matchings in \(k\)-partite \(k\)-uniform hypergraphs
• Perfect matchings in uniform hypergraphs with large minimum degree
• Perfect matchings in 3-partite 3-uniform hypergraphs

This page was built for publication: An existence theorem of perfect matching on \(k\)-partite \(k\)-uniform hypergraphs via distance spectral radius

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