Perfect matchings in \(r\)-partite \(r\)-graphs
From MaRDI portal
Publication:2519794
DOI10.1016/j.ejc.2008.02.011zbMath1204.05072arXiv0911.4008OpenAlexW2082377673MaRDI QIDQ2519794
Philipp Sprüssel, Angelos Georgakopoulos, Ron Aharoni
Publication date: 27 January 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.4008
Related Items (19)
Transversals and bipancyclicity in bipartite graph families ⋮ Packing \(k\)-partite \(k\)-uniform hypergraphs ⋮ Perfect matchings in 3-partite 3-uniform hypergraphs ⋮ Perfect matchings in 4-uniform hypergraphs ⋮ Permanents of multidimensional matrices: Properties and applications ⋮ Almost Perfect Matchings in $k$-Partite $k$-Graphs ⋮ Exact minimum degree thresholds for perfect matchings in uniform hypergraphs ⋮ Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees ⋮ Families of triples with high minimum degree are Hamiltonian ⋮ Polynomial-time perfect matchings in dense hypergraphs ⋮ On a rainbow version of Dirac's theorem ⋮ Note on matchings in 3-partite 3-uniform hypergraphs ⋮ Unnamed Item ⋮ Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs ⋮ On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs ⋮ A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs ⋮ Perfect matchings in large uniform hypergraphs with large minimum collective degree ⋮ Pseudorandom hypergraph matchings ⋮ Tight bounds for powers of Hamilton cycles in tournaments
Cites Work
This page was built for publication: Perfect matchings in \(r\)-partite \(r\)-graphs
