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$.
@article{10_37236_6460,
author = {P. E. Haxell and A. D. Scott},
title = {A note on intersecting hypergraphs with large cover number},
journal = {The electronic journal of combinatorics},
year = {2017},
volume = {24},
number = {3},
doi = {10.37236/6460},
zbl = {1369.05155},
url = {http://geodesic.mathdoc.fr/articles/10.37236/6460/}
}
TY - JOUR
AU - P. E. Haxell
AU - A. D. Scott
TI - A note on intersecting hypergraphs with large cover number
JO - The electronic journal of combinatorics
PY - 2017
VL - 24
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/6460/
DO - 10.37236/6460
ID - 10_37236_6460
ER -
%0 Journal Article
%A P. E. Haxell
%A A. D. Scott
%T A note on intersecting hypergraphs with large cover number
%J The electronic journal of combinatorics
%D 2017
%V 24
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/6460/
%R 10.37236/6460
%F 10_37236_6460
P. E. Haxell; A. D. Scott. A note on intersecting hypergraphs with large cover number. The electronic journal of combinatorics, Tome 24 (2017) no. 3. doi: 10.37236/6460
