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)