A Note on Intersecting Hypergraphs with Large Cover Number

  • P. E. Haxell
  • A. D. Scott
DOI: https://doi.org/10.37236/6460
Keywords: Partite hypergraph, Intersecting, Cover

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$.

Published
2017-08-11
How to Cite
Haxell, P. E., & Scott, A. D. (2017). A Note on Intersecting Hypergraphs with Large Cover Number. The Electronic Journal of Combinatorics, 24(3), P3.26. https://doi.org/10.37236/6460
Issue
Volume 24, Issue 3 (2017)
Article Number
P3.26