Abstract

We prove that the first homology group of every planar locally finite transitive graph $G$ is finitely generated as an $\Aut(G)$-module and we prove a similar result for the fundamental group of locally finite planar Cayley graphs. Corollaries of these results include Droms's theorem that planar groups are finitely presented and Dunwoody's theorem that planar locally finite transitive graphs are accessible.

Highlights

  • A finitely generated group is planar if it has some locally finite planar Cayley graph

  • The fundamental group of G has a generating set consisting of finitely many FS -orbits

  • Every planar locally finite transitive graph G has a set of cycles that generates the first homology group and consists of finitely many Aut(G)-orbits

Read more

Summary

Introduction

A finitely generated group is planar if it has some locally finite planar Cayley graph. Every planar locally finite transitive graph G has a set of cycles that generates the first homology group and consists of finitely many Aut(G)-orbits. We will prove our first main step in Section 4: we will see that in finitely separable 3-connected planar graphs the space of all closed walks has a nested generating set (Theorem 13).

Indecomposable closed walks
Counting crossing cycles
Finding a nested generating set
Finding a finite generating set
Fundamental group of planar graphs
Homology group of planar graphs
Accessibility
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.