Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Nash-Williams–Tutte_theorem
|
| gptkbp:appliesTo |
finite undirected graphs
|
| gptkbp:concerns |
edge-disjoint spanning trees
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Nash-Williams theorem
|
| gptkbp:namedAfter |
gptkb:Crispin_Nash-Williams
|
| gptkbp:publicationYear |
1961
|
| gptkbp:publishedIn |
gptkb:Journal_of_the_London_Mathematical_Society
|
| gptkbp:relatedTo |
gptkb:Tutte_theorem
|
| gptkbp:state |
A finite graph has k edge-disjoint spanning trees if and only if for every partition of the vertex set into t nonempty subsets, there are at least k(t-1) edges between the subsets.
|
| gptkbp:bfsParent |
gptkb:C._St._J._A._Nash-Williams
|
| gptkbp:bfsLayer |
7
|