A note on intersecting hypergraphs with large cover number

zbMath1369.05155arXiv1609.05458MaRDI QIDQ2401407

Penny E. Haxell, Alexander D. Scott

Publication date: 8 September 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

coverintersectingpartite hypergraph

Mathematics Subject Classification ID

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

Related Items (7)

Generalizations and strengthenings of Ryser's conjecture ⋮ A family of extremal hypergraphs for Ryser's conjecture ⋮ On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs ⋮ Ryser's conjecture for \(t\)-intersecting hypergraphs ⋮ On Ryser's conjecture for linear intersecting multipartite hypergraphs ⋮ Nonintersecting Ryser Hypergraphs ⋮ Covering graphs by monochromatic trees and Helly-type results for hypergraphs

Cites Work

• Unnamed Item
• On Ryser's conjecture
• Extremal hypergraphs for Ryser's conjecture
• On Ryser's conjecture for linear intersecting multipartite hypergraphs
• Ryser's conjecture for tripartite 3-graphs
• A comment on Ryser's conjecture for intersecting hypergraphs
• Covering finite fields with cosets of subspaces
• The blocking number of an affine space
• The exceptional set of Goldbach's problem
• 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: A note on intersecting hypergraphs with large cover number