UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

A note on intersecting hypergraphs with large cover number

Thumbnail Image

Files

6460-PDF file-21681-1-10-20170802.pdf (235.34 KB)

Date

2017-08-11

Authors

Haxell, P.E.
Scott, A.D.

Journal Title

Journal ISSN

Volume Title

Publisher

The Electronic Journal of Combinatorics

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.

Description

Published by 'The Electronic Journal of Combinatorics' at 10.37236/6460.

Keywords

partite hypergraph, intersecting, cover

LC Keywords

Citation

URI

https://doi.org/10.37236/6460
 http://hdl.handle.net/10012/16026

Collections

Waterloo Research
Combinatorics and Optimization