Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited
From MaRDI portal
Publication:6188119
DOI10.1002/jcd.21763arXiv2011.04444OpenAlexW3112657543MaRDI QIDQ6188119
Publication date: 1 February 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.04444
Hypergraphs (05C65) Finite affine and projective planes (geometric aspects) (51E15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- On Ryser's conjecture for linear intersecting multipartite hypergraphs
- On a problem of Erdős and Lovász: Random lines in a projective plane
- On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs
- Generalizations and strengthenings of Ryser's conjecture
- Monochromatic tree covers and Ramsey numbers for set-coloured graphs
- Practical graph isomorphism. II.
- On a Problem of Erdos and Lovasz. II: n(r) = O(r)
- Multipartite hypergraphs achieving equality in Ryser's conjecture