On Ryser's conjecture (Q426782)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On Ryser's conjecture |
scientific article; zbMATH DE number 6045647
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Ryser's conjecture |
scientific article; zbMATH DE number 6045647 |
Statements
On Ryser's conjecture (English)
0 references
12 June 2012
0 references
Summary: Motivated by an old problem known as Ryser's Conjecture, we prove that for \(r=4\) and \(r=5\), there exists \(\epsilon>0\) such that every \(r\)-partite \(r\)-uniform hypergraph \(\mathcal H\) has a cover of size at most \((r-\epsilon)\nu(\mathcal H)\), where \(\nu(\mathcal H)\) denotes the size of a largest matching in \(\mathcal H\).
0 references
largest matching
0 references
