Nonintersecting Ryser Hypergraphs

DOI10.1137/19M1241556zbMath1440.05193arXiv1809.06931OpenAlexW3000582475WikidataQ126355866 ScholiaQ126355866MaRDI QIDQ5210906

Anurag Bishnoi, Valentina Pepe

Publication date: 16 January 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

blocking setsextremal combinatoricsRyser's conjecture

Mathematics Subject Classification ID

Hypergraphs (05C65) Blocking sets, ovals, (k)-arcs (51E21) Transversal (matching) theory (05D15)

Related Items (2)

Generalizations and strengthenings of Ryser's conjecture ⋮ Ryser's conjecture for \(t\)-intersecting hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal hypergraphs for Ryser's conjecture
• On Ryser's conjecture for linear intersecting multipartite hypergraphs
• Ryser's conjecture for tripartite 3-graphs
• Blocking sets
• On the size of a blocking set in \(\text{PG}(2,p)\)
• A family of extremal hypergraphs for Ryser's conjecture
• Maximal intersecting families and affine regular polygons in \(PG(2,q)\)
• A note on intersecting hypergraphs with large cover number
• Blocking Sets in Finite Projective Planes
• Ovals In a Finite Projective Plane
• Multipartite hypergraphs achieving equality in Ryser's conjecture

This page was built for publication: Nonintersecting Ryser Hypergraphs