Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Gallai's conjecture
|
| gptkbp:namedAfter |
gptkb:Tibor_Gallai
|
| gptkbp:proposedBy |
1962
|
| gptkbp:provenBy |
trees
graphs with at most one odd degree vertex |
| gptkbp:relatedTo |
edge-disjoint paths
path decomposition |
| gptkbp:sentence |
Every connected graph with n vertices can be decomposed into at most ⌈n/2⌉ edge-disjoint paths.
|
| gptkbp:status |
open (for general graphs)
|
| gptkbp:bfsParent |
gptkb:Tibor_Gallai
|
| gptkbp:bfsLayer |
6
|