Cutting up graphs revisited -- a short proof of Stallings' structure theorem. (Q3085994)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cutting up graphs revisited -- a short proof of Stallings' structure theorem. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cutting up graphs revisited -- a short proof of Stallings' structure theorem. |
scientific article |
Statements
Cutting up graphs revisited – a short proof of Stallings' structure theorem (English)
0 references
1 April 2011
0 references
Stallings theorem
0 references
finitely generated groups with more than one end
0 references
structure trees
0 references
Bass-Serre theory
0 references
0.8504449129104614
0 references
0.7987225651741028
0 references
0.7900095582008362
0 references
0.7817777991294861
0 references
