Perfect matchings in balanced hypergraphs

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)

zbMATH Keywords

perfect matchingbalanced hypergraphtheorem of Hall

Mathematics Subject Classification ID

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

Related Items

A note on the duality between matchings and vertex covers in balanced hypergraphs, Hall's and Kőnig's theorem in graphs and hypergraphs, A hyperedge coloring and application in combinatorial testing, \(d\)-matching in 3-uniform hypergraphs, Balanced matrices, Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach, Perfect, ideal and balanced matrices, Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs, Decomposition of balanced matrices

Cites Work

• Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
• On Representatives of Subsets
• Unnamed Item
• Unnamed Item