Infinite distance transitive graphs of finite valency
- 75 Downloads
We determine all infinite distance transitive graphs of finite valency, thereby proving a conjecture of C. D. Godsil. The proof makes heavy use of a theorem of M. J. Dunwoody concerning cuts of infinite graphs. In section 1 there is a rough analysis of the appearance of such graphs, and in section 2 we state and apply Dunwoody’s theorem. The proof is completed in section 3.
AMS subject classification (1980)05 C 25
Unable to display preview. Download preview PDF.