Coverings and matchings in r-partite hypergraphs

DOI10.1002/NET.20459MaRDI QIDQ2913952zbMATH OpenOpenAlexFDO

Authors 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

matchingcoveringRyser's conjectureintersecting hypergraphsr-partite hypergraphs

Mathematics Subject Classification ID

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

Recommendations

• A comment on Ryser's conjecture for intersecting hypergraphs
• On Ryser's conjecture for linear intersecting multipartite hypergraphs
• Nonintersecting Ryser Hypergraphs
• Multipartite hypergraphs achieving equality in Ryser's conjecture
• A family of extremal hypergraphs for Ryser's conjecture

Cites work

• scientific article; zbMATH DE number 3884213 (Why is no real title available?)
• A comment on Ryser's conjecture for intersecting hypergraphs
• Balanced matrices
• Maximum degree and fractional matchings in uniform hypergraphs
• On the ratio of optimal integral and fractional covers
• Ryser's conjecture for tripartite 3-graphs
• Schema mapping discovery from data instances

Cited in

(8)

• Generalizations and strengthenings of Ryser's conjecture
• On Ryser's conjecture
• On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs
• A note on intersecting hypergraphs with large cover number
• A comment on Ryser's conjecture for intersecting hypergraphs
• Ryser's conjecture for \(t\)-intersecting hypergraphs
• The feasible matching problem
• Multipartite hypergraphs achieving equality in Ryser's conjecture

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

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