Topology of finite graphs

  title={Topology of finite graphs},
  author={J. Stallings},
  journal={Inventiones mathematicae},
  • J. Stallings
  • Published 1983
  • Mathematics
  • Inventiones mathematicae
This paper derives from a course in group theory which I gave at Berkeley in 1982. I wanted to prove the standard theorems on free groups, and discovered that, after a few preliminaries, the notion of "locally injective" map (or "immersion") of graphs was very useful. This enables one to see, in an effective, easy, algorithmic way just what happens with finitely generated free groups. One can understand in this way (1) Howson's theorem that if A and B are finitely generated subgroups of a free… Expand
On intersections of finitely generated subgroups of free groups
and asked if the factor 2 can be dropped. If one translates her approach (which is a slight modification of Howson's) to graph-theoretic terms, it easily shows that the answer is often "yes"in fact,Expand
On fixed points of automorphisms of finitely generated free groups
If <f> is an automorphism of a finitely generated free group, then Fix(<£) is finitely generated. 0. Introduction. A conjecture attributed to G. P. Scott [St2] states that the fixed points of anExpand
A conjecture on the Hall topology for the free group
The Hall topology for the free group is the coarsest topology such that every group morphism from the free group onto a finite discrete group is continuous. It was shown by M. Hall Jr. that everyExpand
Graphs, intersections of subgroups of free groups and corank
  • P. Weil
  • Mathematics, Computer Science
  • Electron. Notes Discret. Math.
  • 2001
The main result which is discussed here is the proof that the conjecture holds when one of the subgroups is positively generated, that is, it admits a system of generators which can be written without using the inverses of the letters in A. Meakin and the author. Expand
On Whitehead's algorithm
One can decide effectively when two finitely generated subgroups of a finitely generated free group F are equivalent under an automorphism of F. The subgroup of automorphisms of F mapping a givenExpand
O ct 2 00 6 Hall ’ s Theorem for Limit Groups
A celebrated theorem of Marshall Hall implies that finitely generated free groups are subgroup separable and that all of their finitely generated subgroups are retracts of finite-index subgroups. WeExpand
Actions of finite groups on graphs and related automorphisms of free groups
The proof will be completed in Section 6. It is geometrical and the geometrical objects which will be used are graphs on which finite groups act (G-graphs). The following lines are intended toExpand
Inevitable Graphs and Profinite Topologies: Some Solutions to Algorithmic Problems in Monoid and Automata Theory, Stemming from Group Theory
  • B. Steinberg
  • Mathematics, Computer Science
  • Int. J. Algebra Comput.
  • 2001
If the extension problem for partial one-to-one maps for H is decidable, then so is the set of regular elements of the H-kernel of a finite monoid, and certain pseudovarieties of groups, including the pseudovorieties of p-groups for p prime, are hyperdecidable. Expand
Combinatorial Group Theory, Inverse Monoids, Automata, And Global Semigroup Theory
This paper obtains an inverse monoid theoretic condition for a subgroup to be quasiconvex allowing semigroup theoretic variants on the usual proofs that the intersection of such subgroups is quasiconsvex and that such sub groups are finitely generated. Expand
Finite state automata: A geometric approach
Recently, finite state automata, via the advent of hyperbolic and automatic groups, have become a powerful tool in geometric group theory. This paper develops a geometric approach to automata theory,Expand


Some finitely presented subgroups of the automorphism group of a free group
The aim of this paper is to show that certain “natural” subgroups of the automorphism group ~2 of a finitely generated free group F have finite presentations. It follows from our results, as aExpand
A note on free groups
The object of this note is to point out a theorem of M. Hall, Jr. (Theorem 1), proved, but formulated in a weaker form, as Theorem 5.1 of [2]. We then show that results of Karrass and Solitar [5],Expand
Intersection of finitely generated subgroups of free groups and resolutions of graphs
Arbres, amalgames SL 2
  • Ast6risque No. 46, Soci6t6 Math. deFrance
  • 1977
Subgroup theorems and graphs
Discrete groups of motions
On the Intersection of Finitely Generated Free Groups
Coset representations in free groups