Loading...
Please wait, while we are loading the content...
Similar Documents
Cutting up graphs revisited – a short proof of Stallings' structure theorem
| Content Provider | Scilit |
|---|---|
| Author | Krön, Bernhard |
| Copyright Year | 2010 |
| Description | This is a short proof of the existence of finite sets of edges in graphs with more than one end, such that after removing them we obtain two components which are nested with all their isomorphic images. This was first done in “Cutting up graphs” [Dunwoody, Combinatorica 2: 15–23, 1982]. Together with a certain tree construction and some elementary Bass–Serre theory this yields a combinatorial proof of Stallings' theorem on the structure of finitely generated groups with more than one end. |
| Related Links | http://arxiv.org/pdf/1003.1096.pdf |
| ISSN | 18671144 |
| e-ISSN | 18696104 |
| DOI | 10.1515/gcc.2010.013 |
| Journal | Groups - Complexity - Cryptology |
| Issue Number | 2 |
| Volume Number | 2 |
| Language | English |
| Publisher | Walter de Gruyter GmbH |
| Publisher Date | 2010-01-01 |
| Access Restriction | Open |
| Subject Keyword | Journal: Groups - Complexity - Cryptology Groups - Complexity - Cryptology Literary Studies Stallings Theorem On Groups with More Than One End Structure Trees |
| Content Type | Text |
| Resource Type | Article |
| Subject | Applied Mathematics Computer Networks and Communications Computational Theory and Mathematics Computational Mathematics |
