English
Related papers

Related papers: The planar Cayley graphs are effectively enumerabl…

200 papers

We show that a group admits a planar, finitely generated Cayley graph if and only if it admits a special kind of group presentation we introduce, called a planar presentation. Planar presentations can be recognised algorithmically. As a…

Combinatorics · Mathematics 2019-01-03 Agelos Georgakopoulos , Matthias Hamann

Let $G$ be a finitely generated group acting faithfully and properly discontinuously by homeomorphisms on a planar surface $X \subseteq \mathbb{S}^2$. We prove that $G$ admits such an action that is in addition co-compact, provided we can…

Combinatorics · Mathematics 2019-05-17 Agelos Georgakopoulos

We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.

Group Theory · Mathematics 2019-02-28 Olga Varghese

We obtain a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. We obtain counterexamples to…

Group Theory · Mathematics 2015-03-18 Agelos Georgakopoulos

We prove that a Cayley graph can be embedded in the euclidean plane without accumulation points of vertices if and only if it is the 1-skeleton of a Cayley complex that can be embedded in the plane after removing redundant simplices. We…

Group Theory · Mathematics 2015-03-17 Agelos Georgakopoulos

We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…

Group Theory · Mathematics 2026-05-06 John M. Mackay , Joseph P. MacManus , Davide Spriano

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

Group Theory · Mathematics 2009-05-08 M. J. Dunwoody

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

Group Theory · Mathematics 2026-05-14 Joseph Paul MacManus

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

We characterize the set of planar locally finite Cayley graphs, and give a finite representation of these graphs by a special kind of finite state automata called labeling schemes. As a result, we are able to enumerate and describe all…

Discrete Mathematics · Computer Science 2007-05-23 David Renault

Two finitely generated monoids are constructed, one finitely presented the other not, whose (directed, unlabelled) Cayley graphs are isomorphic.

Group Theory · Mathematics 2016-10-18 J. Awang , M. Pfeiffer , N. Ruskuc

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…

Group Theory · Mathematics 2025-04-03 Murray Elder , Adam Piggott , Florian Stober , Alexander Thumm , Armin Weiß

In this article we complete the work of enumerating typical abelian coverings of Cayley graphs, by reducing the problem to enumerating certain subgroups of finite abelian groups.

Combinatorics · Mathematics 2024-02-27 Haimiao Chen

Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…

Combinatorics · Mathematics 2024-09-06 Bernat Bassols-Cornudella , Francesco Viganò

Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…

Combinatorics · Mathematics 2008-08-12 Benjamin Steinberg

We construct a 2-generated group $\Gamma $ such that its Cayley graph possesses finite connected subsets with arbitrarily big finite Heesch number.

Group Theory · Mathematics 2015-03-13 Azer Akhmedov

We prove that the first homology group of every planar locally transitive finite graph $G$ is a finitely generated ${\rm Aut}(G)$-module and we prove a similar result for the fundamental group of locally finite planar Cayley graphs.…

Combinatorics · Mathematics 2016-05-13 Matthias Hamann

In this paper we are interested in the asymptotic enumeration of Cayley graphs. It has previously been shown that almost every Cayley digraph has the smallest possible automorphism group: that is, it is a digraphical regular representation…

Combinatorics · Mathematics 2020-05-18 Joy Morris , Mariapia Moscatiello , Pablo Spiga

A map is a connected topological graph $\Gamma$ cellularly embedded in a surface. In this paper, applying Tutte's algebraic representation of map, new ideas for enumerating non-equivalent orientable or non-orientable maps of graph are…

General Mathematics · Mathematics 2009-09-29 Linfan Mao , Yanpei Liu

We show that a finitely presented group virtually admits a planar Cayley graph if and only if it is asymptotically minor-excluded, partially answering a conjecture of Georgakopoulos and Papasoglu in the affirmative.

Group Theory · Mathematics 2025-06-05 Joseph MacManus
‹ Prev 1 2 3 10 Next ›