Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
bipartite graphs
0-1 matrices |
| gptkbp:concerns |
gptkb:Latin_squares
transversals matchings |
| gptkbp:field |
combinatorics
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Ryser's theorem
|
| gptkbp:namedAfter |
gptkb:Herbert_John_Ryser
|
| gptkbp:publishedIn |
1957
|
| gptkbp:sentence |
For a (0,1)-matrix, the maximum number of 1s in a matrix with no all-1 submatrix of size (k+1)×(k+1) is k*n.
In any r-partite r-uniform hypergraph, the size of the largest matching is at least the minimum of the sizes of the vertex classes. |
| gptkbp:bfsParent |
gptkb:H._J._Ryser
|
| gptkbp:bfsLayer |
8
|