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...
Main Authors: | Haxell, P, Scott, A |
---|---|
格式: | Journal article |
出版: |
Electronic Journal of Combinatorics
2017
|
相似书籍
-
Intersections of hypergraphs
由: Bollobas, B, et al.
出版: (2014) -
Fractional covers of hypergraphs with bounded multi-intersection
由: Gottlob, G, et al.
出版: (2023) -
Intersections of random hypergraphs and tournaments
由: Bollobas, B, et al.
出版: (2014) -
Edge intersection hypergraphs
由: Martin Sonntag, et al.
出版: (2024-01-01) -
A Characterization of Hypergraphs with Large Domination Number
由: Henning Michael A., et al.
出版: (2016-05-01)