A Finitary Structure Theorem for Vertex-Transitive Graphs of Polynomial Growth

نویسندگان

چکیده

We prove a quantitative, finitary version of Trofimov’s result that connected, locally finite vertex-transitive graph Γ polynomial growth admits quotient with fibres on which the action Aut(Γ) is virtually nilpotent vertex stabilisers. also present some applications. show finite, connected large diameter small abelian stabilisers bounded size. has moderate in sense Diaconis and Saloff-Coste, known to imply mixing relaxation times lazy random walk are quadratic diameter. These results extend Breuillard second author for Cayley graphs Finally, given exhibiting at single, sufficiently scale, we describe its subsequent scales, extending Tao an earlier our own graphs. In forthcoming work will give further

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vertex-transitive CIS graphs

A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and vertex-transitive if, for every pair of vertices, there exists an automorphism of the graph mapping one to the other. We show that a vertex-transitive graph is CIS if and o...

متن کامل

A Construction for Vertex-transitive Graphs

1. Introduction. A useful general strategy for the construction of interesting families of vertex-transitive graphs is to begin with some family of transitive permutation groups and to construct for each group T in the family all graphs G whose vertex-set is the orbit V of T and for which T ^ Aut (G), where Aut (G) denotes the automorphism group of G. For example, if we consider the family of c...

متن کامل

Cores of Vertex Transitive Graphs

A core of a graph X is a vertex minimal subgraph to which X admits a homomorphism. Hahn and Tardif have shown that for vertex transitive graphs, the size of the core must divide the size of the graph. This motivates the following question: when can the vertex set of a vertex transitive graph be partitioned into sets each of which induce a copy of its core? We show that normal Cayley graphs and ...

متن کامل

Limits of vertex-transitive graphs

The class of all connected vertex-transitive graphs with finite valency forms a metric space under a natural combinatorially defined metric. We prove some basic properties of this metric space and discuss the structure of graphs which are limit points of the subset consisting of all finite graphs that admit a vertex-primitive group of automorphisms. A description of these limit graphs would pro...

متن کامل

Compression of Vertex Transitive Graphs

We consider the lossless compression of vertex transitive graphs. An undirected graph G = (V, E) is called vertex transitive if for every pair of vertices x, y ∈ V , there is an automorphism σ of G, such that σ(x) = y. A result due to Sabidussi, guarantees that for every vertex transitive graph G there exists a graph mG (m is a positive integer) which is a Cayley graph. We propose as the compre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorica

سال: 2021

ISSN: ['0209-9683', '1439-6912']

DOI: https://doi.org/10.1007/s00493-020-4295-6