Cutting up graphs revisited – a short proof of Stallings' structure theorem (Q3085994): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q947726
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Bernhard Krön / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1003.1096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accessibility and Groups of Cohomological Dimension One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting up graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Enden topologischer Räume und Gruppen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Enden diskreter Räume und Gruppen / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectivities of finite and infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite separating sets in locally finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-isometries between non-locally-finite graphs and structure trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ends of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ends of graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Andrews-Gordon style identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On torsion-free groups with infinitely many ends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-transitive graphs and accessibility / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963537376 / rank
 
Normal rank

Latest revision as of 11:02, 30 July 2024

scientific article
Language Label Description Also known as
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 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references