Perfect matchings in balanced hypergraphs
From MaRDI portal
Publication:2563509
DOI10.1007/BF01261318zbMath0864.05074MaRDI QIDQ2563509
Michele Conforti, Ajai Kapoor, Kristina Vušković, Cornuéjols, Gérard
Publication date: 23 January 1997
Published in: Combinatorica (Search for Journal in Brave)
05A18: Partitions of sets
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
A hyperedge coloring and application in combinatorial testing, Perfect, ideal and balanced matrices, A note on the duality between matchings and vertex covers in balanced hypergraphs, Decomposition of balanced matrices, Hall's and Kőnig's theorem in graphs and hypergraphs, \(d\)-matching in 3-uniform hypergraphs, Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach, Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs, Balanced matrices
Cites Work