Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
r-partite r-uniform hypergraphs
|
| gptkbp:field |
combinatorics
hypergraph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Ryser's conjecture
|
| gptkbp:implies |
Ryser's conjecture for r=2 is König's theorem
|
| gptkbp:namedAfter |
gptkb:Herbert_John_Ryser
|
| gptkbp:proposedBy |
gptkb:Herbert_John_Ryser
|
| gptkbp:sentence |
In every r-partite r-uniform hypergraph, the vertex covering number is at most (r-1) times the matching number.
|
| gptkbp:solvedBy |
r=2
r=3 |
| gptkbp:status |
open
|
| gptkbp:yearProposed |
1967
|
| gptkbp:bfsParent |
gptkb:H._J._Ryser
gptkb:Brualdi–Ryser_theorem gptkb:Brualdi–Stein_conjecture |
| gptkbp:bfsLayer |
8
|