English
Related papers

Related papers: Planar transitive graphs

200 papers

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

Combinatorics · Mathematics 2025-06-25 Siddharth Malviy , Vipul Kakkar

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…

Group Theory · Mathematics 2019-08-06 Andrea Lucchini

The existence of nonconstant harmonic Dirichlet functions on a Cayley graph of a discrete group is equivalent to the nonvanishing of the first L2-cohomology of the given group. It was first proven by Cheeger and Gromov that such functions…

Geometric Topology · Mathematics 2007-05-23 Gabor Elek , Gabor Tardos

Consider a finite, regular cover $Y\to X$ of finite graphs, with associated deck group $G$. We relate the topology of the cover to the structure of $H_1(Y;\mathbb{C})$ as a $G$-representation. A central object in this study is the {\em…

Geometric Topology · Mathematics 2016-10-28 Benson Farb , Sebastian Hensel

A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…

Combinatorics · Mathematics 2015-03-25 Massimo Giulietti , Stefano Marcugini , Fernanda Pambianco , Sanming Zhou

The subdivision graph $S(\Sigma)$ of a connected graph $\Sigma$ is constructed by adding a vertex in the middle of each edge. In a previous paper written with Cheryl E. Praeger, we characterised the graphs $\Sigma$ such that $S(\Sigma)$ is…

Combinatorics · Mathematics 2011-03-31 Ashraf Daneshkhah , Alice Devillers

A recent development in graph-minor theory is to study local separators, vertex-sets that separate graphs locally but not necessarily globally. The local separators of a graph roughly correspond to the genuine separators of its local…

Combinatorics · Mathematics 2025-01-15 Johannes Carmesin , George Kontogeorgiou , Jan Kurkofka , Will J. Turner

Autostackability for finitely presented groups is a topological property of the Cayley graph combined with formal language theoretic restrictions, that implies solvability of the word problem. The class of autostackable groups is known to…

Group Theory · Mathematics 2015-06-02 Mark Brittenham , Susan Hermiller , Ashley Johnson

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

Combinatorics · Mathematics 2009-10-30 Reinhard Diestel , Philipp Sprüssel

It is well-known that a complete Riemannian manifold M which is locally isometric to a symmetric space is covered by a symmetric space. Here we prove that a discrete version of this property (called local to global rigidity) holds for a…

Metric Geometry · Mathematics 2019-11-26 Mikael de la Salle , Romain Tessera

In this paper, we construct a family of quasi-strongly regular Cayley graphs $\Gamma_H(G)$ which is defined on a finite group $G$ with respect to a subgroup $H$ of $G$. We also compute its full automorphism group and characterize various…

Group Theory · Mathematics 2026-03-17 Sucharita Biswas , Angsuman Das

Consider an ergodic unimodular random one-ended planar graph $\G$ of finite expected degree. We prove that it has an isometry-invariant locally finite embedding in the Euclidean plane if and only if it is invariantly amenable. By "locally…

Probability · Mathematics 2021-10-27 Itai Benjamini , Adam Timar

We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable…

Combinatorics · Mathematics 2017-12-29 Micheal Pawliuk , Miodrag Sokic

We generalise the standard constructions of a Cayley graph in terms of a group presentation by allowing some vertices to obey different relators than others. The resulting notion of presentation allows us to represent every vertex…

Combinatorics · Mathematics 2020-07-14 Agelos Georgakopoulos , Matthias Hamann , Alex Wendland

For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…

Group Theory · Mathematics 2024-07-10 Thomas Michael Keller , Gavin Pettigrew , Saskia Solotko , Lixin Zheng

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…

Group Theory · Mathematics 2024-12-17 Murray Elder , Giles Gardam , Adam Piggott , Davide Spriano , Kane Townsend

We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.

Group Theory · Mathematics 2015-10-26 John R. Britnell , Nick Gill

This is a draft of a book submitted for publication by the AMS. Its theme is the remarkable interplay, accelerating in the last few decades, between topology and the theory of orderable groups, with applications in both directions. It…

Geometric Topology · Mathematics 2015-11-17 Adam Clay , Dale Rolfsen

Given a finite group $G$, its prime graph $\Gamma(G)$ (also known as its Gruenberg-Kegel graph) is the graph whose vertices are the prime divisors of $|G|$ and where edges $\{p, q\}$ exist whenever $G$ contains an element of order $pq$. We…

Group Theory · Mathematics 2025-11-21 Lucas Alland , Andrei Fridman , Thomas Michael Keller

The path spaces of a directed graph play an important role in the study of graph $\css$. These are topological spaces that were originally constructed using groupoid and inverse semigroup techniques. In this paper, we develop a simple,…

Operator Algebras · Mathematics 2007-05-23 Alan L. T. Paterson , Amy E. Welch