Topology of finite graphs

@article{Stallings1983TopologyOF,
  title={Topology of finite graphs},
  author={John R. Stallings},
  journal={Inventiones mathematicae},
  year={1983},
  volume={71},
  pages={551-565}
}
  • J. Stallings
  • Published 1 March 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… 
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,
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 an
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 every
Graphs, intersections of subgroups of free groups and corank
  • P. Weil
  • Mathematics
    Electron. Notes Discret. Math.
  • 2001
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 given
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. We
Inevitable Graphs and Profinite Topologies: Some Solutions to Algorithmic Problems in Monoid and Automata Theory, Stemming from Group Theory
TLDR
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.
Remarks on the Intersection of Finitely Generated Subgroups of a Free Group
Abstract The first result gives a (modest) improvement of the best general bound known to date for the rank of the intersection U ∩ V of two finite-rank subgroups of a free group F in terms of the
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,
...
...

References

SHOWING 1-8 OF 8 REFERENCES
Some finitely presented subgroups of the automorphism group of a free group
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],
Discrete Groups of Motions
This paper deals with the discrete groups of rigid motions of the hyperbolic plane. It is known (12) that the finitely generated, orientation-preserving groups have the following presentations:
On the Intersection of Finitely Generated Free Groups
Arbres, amalgames SL 2
  • Ast6risque No. 46, Soci6t6 Math. deFrance
  • 1977