Coverings and matchings in r-partite hypergraphs

DOI10.1002/NET.20459zbMATH Open1248.05150OpenAlexW2018669192MaRDI QIDQ2913952FDOQ2913952

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

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

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)

Cites Work

• On the ratio of optimal integral and fractional covers
• Ryser's conjecture for tripartite 3-graphs
• Balanced matrices
• Maximum degree and fractional matchings in uniform hypergraphs
• Title not available (Why is that?)
• A comment on Ryser's conjecture for intersecting hypergraphs
• Schema mapping discovery from data instances

Cited In (2)

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

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)