AbstractWe show how results concerning infinite, locally finite, vertex-symmetric graphs can be related with the structure theory of topological groups, when the latter is applied to automorphism groups of the graphs. In particular, we discuss polynomial growth, bounded automorphisms and infinite expanders. In an appendix, we present three problems on infinite graphs, not necessarily linked with topological considerations
AbstractLet X be a connected locally finite transitive graph with polynomial growth. We prove that g...
We prove that, given an infinite group G there is a directed graph X such that its automorphism grou...
This paper concerns aspects of various graphs whose vertex set is a group G and whose edges reflect ...
AbstractWe show how results concerning infinite, locally finite, vertex-symmetric graphs can be rela...
AbstractWe give a short proof of a theorem of Trofimov, using the theory of topological groups. An a...
AbstractIn this paper we give an overview on connected locally finite transitive graphs with polynom...
AbstractWe give a short proof of a theorem of Trofimov, using the theory of topological groups. An a...
Let Γ be a graph which is countable and locally finite (every vertex has finite degree). Then the au...
AbstractLet X be a connected locally finite transitive graph with polynomial growth. We prove that g...
Let $X$ be a connected, locally finite graph with symmetric growth. We prove that there is a vertex ...
The class of all connected vertex-transitive graphs with finite valency forms a metric space under a...
A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be e...
A graph is said to have infinite motion, if every automorphism moves infinitely many vertices. Tucke...
A graph is said to have infinite motion, if every automorphism moves infinitely many vertices. Tucke...
AbstractThe closure of a set A of vertices of an infinite graph G is defined as the set of vertices ...
AbstractLet X be a connected locally finite transitive graph with polynomial growth. We prove that g...
We prove that, given an infinite group G there is a directed graph X such that its automorphism grou...
This paper concerns aspects of various graphs whose vertex set is a group G and whose edges reflect ...
AbstractWe show how results concerning infinite, locally finite, vertex-symmetric graphs can be rela...
AbstractWe give a short proof of a theorem of Trofimov, using the theory of topological groups. An a...
AbstractIn this paper we give an overview on connected locally finite transitive graphs with polynom...
AbstractWe give a short proof of a theorem of Trofimov, using the theory of topological groups. An a...
Let Γ be a graph which is countable and locally finite (every vertex has finite degree). Then the au...
AbstractLet X be a connected locally finite transitive graph with polynomial growth. We prove that g...
Let $X$ be a connected, locally finite graph with symmetric growth. We prove that there is a vertex ...
The class of all connected vertex-transitive graphs with finite valency forms a metric space under a...
A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be e...
A graph is said to have infinite motion, if every automorphism moves infinitely many vertices. Tucke...
A graph is said to have infinite motion, if every automorphism moves infinitely many vertices. Tucke...
AbstractThe closure of a set A of vertices of an infinite graph G is defined as the set of vertices ...
AbstractLet X be a connected locally finite transitive graph with polynomial growth. We prove that g...
We prove that, given an infinite group G there is a directed graph X such that its automorphism grou...
This paper concerns aspects of various graphs whose vertex set is a group G and whose edges reflect ...
DOI
Add to ORKG