Intersecting extremal constructions in Ryser's Conjecture for r-partite hypergraphs

zbMath1383.05221arXiv1409.4938MaRDI QIDQ4604126

A. Abu-Khazneh, Alexey Pokrovskiy

Publication date: 23 February 2018

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

Mathematics Subject Classification ID

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

Related Items (9)

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 ⋮ Covers in partitioned intersecting hypergraphs ⋮ Extremal hypergraphs for Ryser's conjecture ⋮ On Ryser's conjecture for linear intersecting multipartite hypergraphs ⋮ Multipartite hypergraphs achieving equality in Ryser's conjecture ⋮ Covering graphs by monochromatic trees and Helly-type results for hypergraphs

This page was built for publication: Intersecting extremal constructions in Ryser's Conjecture for r-partite hypergraphs