ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
European Journal of Combinatorics
Volume 28, Issue 2, February 2007, Pages 613-640
Groups and Geometries
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (394 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.ejc.2005.05.010    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2005 Elsevier Ltd All rights reserved.

Vertex stabilizers of graphs and tracks, Istar, open

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Vladimir I. Trofimova, E-mail The Corresponding Author

aInstitute of Mathematics and Mechanics, Russian Academy of Sciences, S. Kovalevskoy, 16, 620219 Ekaterinburg, Russia


Available online 25 October 2005.

Abstract

This paper is devoted to the conjecture saying that, for any connected locally finite graph Γ and any vertex-transitive group G of automorphisms of Γ, at least one of the following assertions holds: (1) There exists an imprimitivity system σ of G on V(Γ) with finite (maybe one-element) blocks such that the stabilizer of a vertex of the factor graph Γ/σ in the induced group of automorphisms Gσ is finite. (2) The graph Γ is hyperbolic (i.e., for some positive integer n, the graph Γn defined by V(Γn)=V(Γ) and E(Γn)={{x,y}:0<dΓ(x,y)≤n} contains the regular tree of valency 3). Our approach to the conjecture consists in fixing a finite permutation group R and considering the conjecture under the assumption that the stabilizer of a vertex of Γ in G induces on the neighborhood of the vertex a group permutation isomorphic to R. In the paper we elaborate a method (the modified track method) which allows us to prove the conjecture for many groups R. The paper consists of two parts. The present first part of the paper involves results on which the modified track method arguments are based, and a few first applications of the method. The second part is devoted to applications of the modified track method.

Article Outline

1. Introduction
2. The Main Conjecture and some related results
3. A trial of the local approach to the Main Conjecture
4. Background for the modified track method
5. The modified track method. First applications
References

star, openThis paper is an extended version of the author’s talk at the Mini-Workshop “Amalgams for Graphs and Geometries” held at Mathematisches Forschungsinstitut Oberwolfach in May, 2004. The visit was kindly supported by the German Science Foundation (DFG) and the association of friends of Oberwolfach (the “Förderverein”).


European Journal of Combinatorics
Volume 28, Issue 2, February 2007, Pages 613-640
Groups and Geometries
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.