A note on intersecting hypergraphs with large cover number
Combinatorics
2017-10-09 v2
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, Barat, Pokrovskiy and Szabo, and shows that a long-standing unsolved conjecture due to Ryser is close to being best possible for every value of r.
Cite
@article{arxiv.1609.05458,
title = {A note on intersecting hypergraphs with large cover number},
author = {Penny Haxell and Alex Scott},
journal= {arXiv preprint arXiv:1609.05458},
year = {2017}
}