A note on intersecting hypergraphs with large cover number
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 fo...
Prif Awduron: | Haxell, P, Scott, A |
---|---|
Fformat: | Journal article |
Cyhoeddwyd: |
Electronic Journal of Combinatorics
2017
|
Eitemau Tebyg
-
Intersections of hypergraphs
gan: Bollobas, B, et al.
Cyhoeddwyd: (2014) -
Fractional covers of hypergraphs with bounded multi-intersection
gan: Gottlob, G, et al.
Cyhoeddwyd: (2023) -
Intersections of random hypergraphs and tournaments
gan: Bollobas, B, et al.
Cyhoeddwyd: (2014) -
Edge intersection hypergraphs
gan: Martin Sonntag, et al.
Cyhoeddwyd: (2024-01-01) -
A Characterization of Hypergraphs with Large Domination Number
gan: Henning Michael A., et al.
Cyhoeddwyd: (2016-05-01)