Coverings and matchings in r-partite hypergraphs

DOI10.1002/net.20459zbMath1248.05150OpenAlexW2018669192MaRDI QIDQ2913952

Douglas S. Altner, J. Paul Brooks

Publication date: 21 September 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20459

zbMATH Keywords

coveringmatchingRyser's conjectureintersecting hypergraphsr-partite hypergraphs

Mathematics Subject Classification ID

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

Related Items (1)

On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs

Cites Work

• Ryser's conjecture for tripartite 3-graphs
• A comment on Ryser's conjecture for intersecting hypergraphs
• Maximum degree and fractional matchings in uniform hypergraphs
• On the ratio of optimal integral and fractional covers
• Schema mapping discovery from data instances
• Balanced matrices
• Unnamed Item

This page was built for publication: Coverings and matchings in r-partite hypergraphs