Vertex-transitive graphs and accessibility

DOI10.1006/jctb.1993.1042zbMath0793.05073OpenAlexW2155552412MaRDI QIDQ1325264

Wolfgang Woess, Carsten Thomassen

Publication date: 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1993.1042

zbMATH Keywords

Cayley graphvertex-transitive graphend structureinfinite geodesicthick endthin endWall's accessibility conjecture

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (39)

Boundary and entropy of space homogeneous Markov chains ⋮ Self-avoiding walks and multiple context-free languages ⋮ Primitivity and ends of graphs ⋮ Two-ended quasi-transitive graphs ⋮ The language of self-avoiding walks ⋮ The isomorphism problem for finite extensions of free groups is in PSPACE ⋮ Integrable orbit equivalence rigidity for free groups ⋮ Vertex Cuts ⋮ A Stallings type theorem for quasi-transitive graphs ⋮ Ends and tangles ⋮ An infinite family of sharply two-arc transitive digraphs ⋮ Percolation on infinite graphs and isoperimetric inequalities ⋮ The fundamental group of a locally finite graph with ends ⋮ The Hausdorff dimension of the harmonic measure for relatively hyperbolic groups ⋮ Context-free pairs of groups. I: Context-free pairs and graphs ⋮ The planar Cayley graphs are effectively enumerable. II ⋮ Sharply \(k\)-arc-transitive-digraphs: finite and infinite examples ⋮ The homology of a locally finite graph with ends ⋮ Context-free pairs of groups. II: Cuts, tree sets, and random walks ⋮ Duality of Ends ⋮ Quasi-isometries between graphs and trees ⋮ Analogues of Cayley graphs for topological groups ⋮ Planar transitive graphs ⋮ The end structure of a graph: Recent results and open problems ⋮ Inaccessible groups and protrees ⋮ The classification of connected-homogeneous digraphs with more than one end ⋮ Transitivity conditions in infinite graphs ⋮ Transitive digraphs with more than one end ⋮ CONTEXT-FREE GROUPS AND THEIR STRUCTURE TREES ⋮ Logical aspects of Cayley-graphs: the group case ⋮ A note on the Poisson boundary of lamplighter random walks ⋮ Locally-finite connected-homogeneous digraphs ⋮ Quasi-isometries between non-locally-finite graphs and structure trees ⋮ Accessibility in transitive graphs ⋮ \(k\)-CS-transitive infinite graphs ⋮ Rational discrete first degree cohomology for totally disconnected locally compact groups ⋮ Cycle-free partial orders and ends of graphs ⋮ Cutting up graphs revisited – a short proof of Stallings' structure theorem ⋮ Fixed sets and free subgroups of groups acting on metric spaces

This page was built for publication: Vertex-transitive graphs and accessibility