On Ryser's conjecture for linear intersecting multipartite hypergraphs

DOI10.1016/j.ejc.2016.10.004zbMath1352.05137arXiv1508.00951OpenAlexW1942517911WikidataQ123127683 ScholiaQ123127683MaRDI QIDQ730257

Sarada Herke, Nevena Francetić, Ian M. Wanless, Brendan D. McKay

Publication date: 27 December 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.00951

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (10)

Generalizations and strengthenings of Ryser's conjecture ⋮ A family of extremal hypergraphs for Ryser's conjecture ⋮ A note on intersecting hypergraphs with large cover number ⋮ On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs ⋮ Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited ⋮ Ryser's conjecture for \(t\)-intersecting hypergraphs ⋮ Extremal hypergraphs for Ryser's conjecture ⋮ On Ryser's conjecture for linear intersecting multipartite hypergraphs ⋮ Nonintersecting Ryser Hypergraphs ⋮ Covering graphs by monochromatic trees and Helly-type results for hypergraphs

Uses Software

• nauty
• Traces

Cites Work

• Unnamed Item
• Unnamed Item
• On Ryser's conjecture
• On Ryser's conjecture for linear intersecting multipartite hypergraphs
• Ryser's conjecture for tripartite 3-graphs
• A family of extremal hypergraphs for Ryser's conjecture
• Matchings and covers in hypergraphs
• A note on intersecting hypergraphs with large cover number
• Practical graph isomorphism. II.
• A survey of Skolem-type sequences and Rosa’s use of them
• Hall's theorem for hypergraphs
• Intersecting extremal constructions in Ryser's Conjecture for r-partite hypergraphs
• Multipartite hypergraphs achieving equality in Ryser's conjecture

This page was built for publication: On Ryser's conjecture for linear intersecting multipartite hypergraphs