Vertex-transitive graphs and accessibility
From MaRDI portal
Recommendations
Cited in
(46)- Transitive digraphs with more than one end
- Analogues of Cayley graphs for topological groups
- Logical aspects of Cayley-graphs: the group case
- Self-avoiding walks and multiple context-free languages
- Cutting up graphs revisited -- a short proof of Stallings' structure theorem.
- Inaccessible groups and protrees
- The homology of a locally finite graph with ends
- Context-free pairs of groups. I: Context-free pairs and graphs
- An infinite family of sharply two-arc transitive digraphs
- The isomorphism problem for finite extensions of free groups is in PSPACE
- Coarse geometry of quasi-transitive graphs beyond planarity
- Percolation on infinite graphs and isoperimetric inequalities
- scientific article; zbMATH DE number 475446 (Why is no real title available?)
- The end structure of a graph: Recent results and open problems
- Presentations for vertex-transitive graphs
- Vertex cuts
- The Hausdorff dimension of the harmonic measure for relatively hyperbolic groups
- \(k\)-CS-transitive infinite graphs
- Duality of ends
- Context-free pairs of groups. II: Cuts, tree sets, and random walks
- Context-free groups and their structure trees.
- The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem
- The classification of connected-homogeneous digraphs with more than one end
- Fixed sets and free subgroups of groups acting on metric spaces
- Planar transitive graphs
- A note on the Poisson boundary of lamplighter random walks
- Accessibility in transitive graphs
- Self-avoiding walks on Cayley graphs through the lens of symbolic dynamics
- The fundamental group of a locally finite graph with ends
- Boundary and entropy of space homogeneous Markov chains
- A Stallings type theorem for quasi-transitive graphs
- Big subsets with small boundaries in a graph with a vertex-transitive group of automorphisms
- Integrable orbit equivalence rigidity for free groups
- Ends and tangles
- Primitivity and ends of graphs
- The language of self-avoiding walks
- Quasi-transitive \(K_{\infty}\)-minor free graphs
- The planar Cayley graphs are effectively enumerable. II
- Two-ended quasi-transitive graphs
- Transitivity conditions in infinite graphs
- Sharply \(k\)-arc-transitive-digraphs: finite and infinite examples
- Locally-finite connected-homogeneous digraphs
- Quasi-isometries between non-locally-finite graphs and structure trees
- Quasi-isometries between graphs and trees
- Rational discrete first degree cohomology for totally disconnected locally compact groups
- Cycle-free partial orders and ends of graphs
This page was built for publication: Vertex-transitive graphs and accessibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1325264)
