English
Related papers

Related papers: Asymptotic enumeration of graphical regular repres…

200 papers

In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…

Combinatorics · Mathematics 2017-05-08 Péter Csikvári

Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…

Combinatorics · Mathematics 2025-10-03 Nyumbu Chishwashwa , Vance Faber , Noah Streib

We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of…

Group Theory · Mathematics 2014-07-18 Aliska Gibbins

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

In this paper we are concerned with the classification of the finite groups admitting a bipartite DRR and a bipartite GRR. First, we find a natural obstruction in a finite group for not admitting a bipartite GRR. Then we give a complete…

Combinatorics · Mathematics 2020-01-15 Jia-Li Du , Yan-Quan Feng , Pablo Spiga

We prove that every locally finite, quasi-transitive graph with a thick end whose cycle space is generated by cycles of bounded length contains the full-grid as an asymptotic minor and as a diverging minor. This in particular includes all…

Combinatorics · Mathematics 2025-10-23 Sandra Albrechtsen , Matthias Hamann

We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations. Using this, we characterize automorphism groups of…

Combinatorics · Mathematics 2015-08-05 Pavel Klavík , Peter Zeman

We describe the full automorphism group of the directed reduced power graph and the undirected reduced power graph of a finite group. We compute the full automorphism groups of these graphs of several classes of finite groups. Also, we…

Group Theory · Mathematics 2024-11-15 T. Anitha , R. Rajkumar

The $k$-representation number of a graph $G$ is the minimum cardinality of the system of vertex subsets with the property that every edge of $G$ is covered at least $k$ times while every non-edge is covered at most $(k-1)$ times. In…

Combinatorics · Mathematics 2024-03-05 Ayush Basu , Vojtěch Rödl , Marcelo Sales

We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…

Metric Geometry · Mathematics 2024-10-29 Or Kalifa

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

Group Theory · Mathematics 2023-09-29 Nikolay Nikolov

We prove a collection of asymptotic density results for several interesting classes of the $I$-graphs. Specifically, we quantify precisely the proportion of $I$-graphs that are generalised Petersen graphs as well as those that are…

Combinatorics · Mathematics 2024-12-30 Harrison Bohl , Adrian W. Dudek

In this paper we study the hyperbolicity properties of a class of random groups arising as graph products associated to random graphs. Recall, that the construction of a graph product is a generalization of the constructions of right-angled…

Group Theory · Mathematics 2014-10-01 Ruth Charney , Michael Farber

We show that every non-trivial compact connected group and every non-trivial general or special linear group over an infinite field admits a generating set such that the associated Cayley graph has infinite diameter.

Group Theory · Mathematics 2019-01-30 Jakob Schneider

We characterise connected cubic graphs admitting a vertex- transitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a…

Combinatorics · Mathematics 2014-01-14 Joy Morris , Pablo Spiga , Gabriel Verret

We show that Cayley graphs of finitely generated Abelian groups are rather rigid. As a consequence we obtain that two finitely generated Abelian groups admit isomorphic Cayley graphs if and only if they have the same rank and their torsion…

Group Theory · Mathematics 2012-08-20 Clara Loeh

In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…

Group Theory · Mathematics 2011-08-12 Olga Kharlampovich , Bakhadyr Khoussainov , Alexei Miasnikov

Let $X$ be a complete smooth variety defined over number field $K$ and $i$ an integer. The absolute Galois group of $K$ acts on the $i$th $l$-adic etale cohomology of $X$ for all $l$, producing a system of $l$-adic representations…

Number Theory · Mathematics 2017-02-24 Chun Yin Hui

Let $S$ be a set of transpositions such that the girth of the transposition graph of $S$ is at least 5. It is shown that the automorphism group of the Cayley graph of the permutation group $H$ generated by $S$ is the semidirect product…

Discrete Mathematics · Computer Science 2013-06-18 Ashwin Ganesan

We show that the probability for a finitely generated subgroup of the modular group, of size $n$, to be almost malnormal or non-parabolic, tends to 0 as $n$ tends to infinity -- where the notion of the size of a subgroup is based on a…

Group Theory · Mathematics 2023-11-15 Frédérique Bassino , Cyril Nicaud , Pascal Weil