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: | , |
|---|---|
| Format: | Journal article |
| Published: |
Electronic Journal of Combinatorics
2017
|
| _version_ | 1826270605124567040 |
|---|---|
| author | Haxell, P Scott, A |
| author_facet | Haxell, P Scott, A |
| author_sort | Haxell, P |
| collection | OXFORD |
| description | 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 for every value of r. |
| first_indexed | 2024-03-06T21:43:27Z |
| format | Journal article |
| id | oxford-uuid:48bddc05-ddf7-4e6f-ae02-cb716eba223b |
| institution | University of Oxford |
| last_indexed | 2024-03-06T21:43:27Z |
| publishDate | 2017 |
| publisher | Electronic Journal of Combinatorics |
| record_format | dspace |
| spelling | oxford-uuid:48bddc05-ddf7-4e6f-ae02-cb716eba223b2022-03-26T15:27:32ZA note on intersecting hypergraphs with large cover numberJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:48bddc05-ddf7-4e6f-ae02-cb716eba223bSymplectic Elements at OxfordElectronic Journal of Combinatorics2017Haxell, PScott, AWe 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 for every value of r. |
| spellingShingle | Haxell, P Scott, A A note on intersecting hypergraphs with large cover number |
| title | A note on intersecting hypergraphs with large cover number |
| title_full | A note on intersecting hypergraphs with large cover number |
| title_fullStr | A note on intersecting hypergraphs with large cover number |
| title_full_unstemmed | A note on intersecting hypergraphs with large cover number |
| title_short | A note on intersecting hypergraphs with large cover number |
| title_sort | note on intersecting hypergraphs with large cover number |
| work_keys_str_mv | AT haxellp anoteonintersectinghypergraphswithlargecovernumber AT scotta anoteonintersectinghypergraphswithlargecovernumber AT haxellp noteonintersectinghypergraphswithlargecovernumber AT scotta noteonintersectinghypergraphswithlargecovernumber |