Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite graphs
|
| gptkbp:author |
gptkb:Oswald_Veblen
|
| gptkbp:field |
gptkb:mathematics
gptkb:topology graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Veblen theorem
|
| gptkbp:namedAfter |
gptkb:Oswald_Veblen
|
| gptkbp:publishedIn |
gptkb:Transactions_of_the_American_Mathematical_Society
|
| gptkbp:relatedTo |
gptkb:Eulerian_circuit
cycle decomposition |
| gptkbp:sentence |
In any finite graph, the set of edges can be partitioned into cycles if and only if every vertex has even degree.
|
| gptkbp:yearProposed |
1912
|
| gptkbp:bfsParent |
gptkb:Oswald_Veblen
|
| gptkbp:bfsLayer |
5
|