A note on intersecting hypergraphs with large cover number
MetadataShow full item record
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.
Cite this version of the work
P.E. Haxell, A.D. Scott (2017). A note on intersecting hypergraphs with large cover number. UWSpace. http://hdl.handle.net/10012/16026