On Ryser's conjecture
Motivated by an old problem known as Ryser's Conjecture, we prove that for r = 4 and r = 5, there exists ∈ > 0 such that every r-partite r-uniform hypergraph H has a cover of size at most (r - ∈)v(H), where v(H) denotes the size of a largest matching in H.
| मुख्य लेखकों: | , |
|---|---|
| स्वरूप: | Journal article |
| भाषा: | English |
| प्रकाशित: |
2012
|
| _version_ | 1826292498780127232 |
|---|---|
| author | Haxell, P Scott, A |
| author_facet | Haxell, P Scott, A |
| author_sort | Haxell, P |
| collection | OXFORD |
| description | Motivated by an old problem known as Ryser's Conjecture, we prove that for r = 4 and r = 5, there exists ∈ > 0 such that every r-partite r-uniform hypergraph H has a cover of size at most (r - ∈)v(H), where v(H) denotes the size of a largest matching in H. |
| first_indexed | 2024-03-07T03:15:38Z |
| format | Journal article |
| id | oxford-uuid:b5ac2eb4-661d-4f5a-a2e8-fc1c3944216b |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T03:15:38Z |
| publishDate | 2012 |
| record_format | dspace |
| spelling | oxford-uuid:b5ac2eb4-661d-4f5a-a2e8-fc1c3944216b2022-03-27T04:35:23ZOn Ryser's conjectureJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:b5ac2eb4-661d-4f5a-a2e8-fc1c3944216bEnglishSymplectic Elements at Oxford2012Haxell, PScott, AMotivated by an old problem known as Ryser's Conjecture, we prove that for r = 4 and r = 5, there exists ∈ > 0 such that every r-partite r-uniform hypergraph H has a cover of size at most (r - ∈)v(H), where v(H) denotes the size of a largest matching in H. |
| spellingShingle | Haxell, P Scott, A On Ryser's conjecture |
| title | On Ryser's conjecture |
| title_full | On Ryser's conjecture |
| title_fullStr | On Ryser's conjecture |
| title_full_unstemmed | On Ryser's conjecture |
| title_short | On Ryser's conjecture |
| title_sort | on ryser s conjecture |
| work_keys_str_mv | AT haxellp onrysersconjecture AT scotta onrysersconjecture |