A note on intersecting hypergraphs with large cover number
Loading...
Date
Authors
Haxell, P.E.
Scott, A.D.
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
The Electronic Journal of Combinatorics
Abstract
We give a construction of r-partite r-uniform intersecting hypergraphs with cover number at least r−4 for all but finitely many r. This answers a question of Abu-Khazneh, Barát, Pokrovskiy and Szabó, and shows that a long-standing unsolved conjecture due to Ryser is close to being best possible for every value of r.
Description
Published by 'The Electronic Journal of Combinatorics' at 10.37236/6460.