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...
主要な著者: | Haxell, P, Scott, A |
---|---|
フォーマット: | Journal article |
出版事項: |
Electronic Journal of Combinatorics
2017
|
類似資料
-
Intersections of hypergraphs
著者:: Bollobas, B, 等
出版事項: (2014) -
Fractional covers of hypergraphs with bounded multi-intersection
著者:: Gottlob, G, 等
出版事項: (2023) -
Intersections of random hypergraphs and tournaments
著者:: Bollobas, B, 等
出版事項: (2014) -
Edge intersection hypergraphs
著者:: Martin Sonntag, 等
出版事項: (2024-01-01) -
A Characterization of Hypergraphs with Large Domination Number
著者:: Henning Michael A., 等
出版事項: (2016-05-01)