Ryser's conjecture for \(t\)-intersecting hypergraphs

DOI10.1016/j.jcta.2020.105366zbMath1457.05072arXiv2001.04132OpenAlexW3111313424WikidataQ113871630 ScholiaQ113871630MaRDI QIDQ2221906

Anurag Bishnoi, Patrick Morris, Shagnik Das, Tibor Szabó

Publication date: 3 February 2021

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

vertex coverRyser's conjectureintersecting hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items

Generalizations and strengthenings of Ryser's conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal hypergraphs for Ryser's conjecture
• On Ryser's conjecture for linear intersecting multipartite hypergraphs
• On finite set-systems whose every intersection is a kernel of a star
• Ryser's conjecture for tripartite 3-graphs
• Finite projective spaces and intersecting hypergraphs
• Symmetric designs as the solution of an extremal problem in combinatorial set theory
• On Sperner families satisfying an additional condition
• Extremal systems with upper-bounded odd intersections
• Extremal set systems with restricted \(k\)-wise intersections.
• A family of extremal hypergraphs for Ryser's conjecture
• On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs
• On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
• Extremal set systems with weakly restricted intersections
• A note on intersecting hypergraphs with large cover number
• Monochromatic tree covers and Ramsey numbers for set-coloured graphs
• Exact \(k\)-wise intersection theorems
• Almost all Steiner triple systems are almost resolvable
• Nonintersecting Ryser Hypergraphs
• Set-systems with restricted multiple intersections