A note on intersecting hypergraphs with large cover number (Q2401407)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6772898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on intersecting hypergraphs with large cover number |
scientific article; zbMATH DE number 6772898 |
Statements
A note on intersecting hypergraphs with large cover number (English)
0 references
8 September 2017
0 references
Summary: 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 \textit{A. Abu-Khazneh} et al. [``A family of extremal hypergraphs for Ryser's conjecture'', Preprint, \url{arXiv:1605.06361}], and shows that a long-standing unsolved conjecture due to \textit{H. J. Ryser} [``Neuere Probleme der Kombinatorik'', in: Vortrage über Kombinatorik, Ober-Wolfach, Mathematisches Forschungsinstitut Oberwolfach, 24--29 (1967)] is close to being best possible for every value of \(r\).
0 references
partite hypergraph
0 references
intersecting
0 references
cover
0 references
0.8922935724258423
0 references
0.8903683423995972
0 references
0.8739191889762878
0 references
0.8660239577293396
0 references
0.8605909943580627
0 references
