Haxell, P.E.Scott, A.D.2020-07-062020-07-062017-08-11https://doi.org/10.37236/6460http://hdl.handle.net/10012/16026Published by 'The Electronic Journal of Combinatorics' at 10.37236/6460.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.enpartite hypergraphintersectingcoverArticle