Journal article icon

Journal article

A note on intersecting hypergraphs with large cover number

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.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Oxford college:
Merton College
Role:
Author
Publisher:
Electronic Journal of Combinatorics Publisher's website
Journal:
Electronic Journal of Combinatorics Journal website
Volume:
7
Issue:
6
Pages:
#P3.26
Publication date:
2017-08-11
Acceptance date:
2017-07-21
ISSN:
1077-8926
Source identifiers:
723842
Keywords:
Pubs id:
pubs:723842
UUID:
uuid:48bddc05-ddf7-4e6f-ae02-cb716eba223b
Local pid:
pubs:723842
Deposit date:
2017-10-06

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP