A note on intersecting hypergraphs with large cover number
classification
🧮 math.CO
keywords
coverhypergraphsintersectingnumberabu-khaznehanswersbaratbest
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.