Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite undirected graphs
|
| gptkbp:category |
combinatorics
graph theory |
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Gallai's theorem
|
| gptkbp:namedAfter |
gptkb:Tibor_Gallai
|
| gptkbp:publicationYear |
1950s
|
| gptkbp:publishedIn |
Mathematicae Annalen
|
| gptkbp:relatedTo |
Handshaking lemma
|
| gptkbp:sentence |
In any finite undirected graph, the number of vertices with odd degree is even.
|
| gptkbp:bfsParent |
gptkb:Tibor_Gallai
|
| gptkbp:bfsLayer |
6
|