English
Related papers

Related papers: Graphs with large girth and free groups

200 papers

Explicit construction of Ramsey graphs has remained a challenging open problem for a long time. Frankl--Wilson \cite{FW}, Alon \cite{A} and Grolmusz \cite{G2} gave the best explicit constructions of graphs on $m$ vertices with no clique or…

Combinatorics · Mathematics 2015-01-06 Gábor Hegedüs

We characterize the equivalence and the weak equivalence of Cayley graphs for a finite group $\C{A}$. Using these characterizations, we find enumeration formulae of the equivalence classes and weak equivalence classes of Cayley graphs. As…

Combinatorics · Mathematics 2007-05-23 Dongseok Kim , Jin Hwan Kim , Jaeun Lee , Dianjun Wang

We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…

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

We investigate the relationship between geometric, analytic and probabilistic indices for quotients of the Cayley graph of the free group ${\rm Cay}(F_n)$ endowed with variable edge lengths, by an arbitrary subgroup $G$ of $F_n$. Our main…

Dynamical Systems · Mathematics 2018-02-26 Johannes Jaerisch , Katsuhiko Matsuzaki

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

Combinatorics · Mathematics 2009-04-14 Julia Brown

We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…

Combinatorics · Mathematics 2020-05-11 Adam Timar

We study the properties of finite graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to some fixed graph $F$. This is a natural extension of the study of regular graphs, and of the study of graphs of…

Combinatorics · Mathematics 2016-12-21 Itai Benjamini , David Ellis

We classify the Cohen-Macaulay weighted oriented graphs whose underlying graphs have girth at least $5$.

Commutative Algebra · Mathematics 2023-08-28 Le Xuan Dung , Tran Nam Trung

Cayley graphs are graphs on algebraic structures, typically groups or group-like structures. In this paper, we have obtained a few results on Cayley graphs on Cyclic groups, powers of cycles, Cayley graphs on some non-abelian groups, and…

Combinatorics · Mathematics 2023-08-23 Prajnanaswaroopa S

In this paper, we prove that any simple $\{C_3,C_5\}$-free non-empty connected graph $G$ with LLY curvature bounded below by $\kappa>0$ has the order at most $2^{\frac{2}{\kappa}}$. This upper bound is achieved if and only if $G$ is a…

Combinatorics · Mathematics 2023-12-29 E. G. K. M. Gamlath , Xiaonan Liu , Linyuan Lu , Xiaofan Yuan

For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…

Group Theory · Mathematics 2017-02-07 Gideon Amir , Gady Kozma

This paper is the second in a series of studies on developing efficient artificial intelligence-based approaches to pathfinding on extremely large graphs (e.g. $10^{70}$ nodes) with a focus on Cayley graphs and mathematical applications.…

Duval, in "A Directed Graph Version of Strongly Regular Graphs" [{\it Journal of Combinatorial Theory}, Series A 47 (1988) 71 - 100], introduced the concept of directed strongly regular graphs. In this paper we construct several rich…

Combinatorics · Mathematics 2015-10-02 Jerod Michel , Baokun Ding

If $G$ is a group and $S$ a generating set, $G$ canonically embeds into the automorphism group of its Cayley graph and it is natural to try to minimize, over all generating sets, the index of this inclusion. This infimum is called the…

Group Theory · Mathematics 2024-03-21 Paul-Henry Leemann , Mikael de la Salle

In this contribution we present a construction of large networks of diameter two and of order $\frac{1}{2}d^2$ for every degree $d\geq 8$, based on Cayley graphs with surprisingly simple underlying groups. For several small degrees we…

Combinatorics · Mathematics 2017-04-21 Marcel Abas

A self-contained exposition is given of the topological and Galois-theoretic properties of the category of combinatorial 1-complexes, or graphs, very much in the spirit of Stallings. A number of classical, as well as some new results about…

Group Theory · Mathematics 2007-05-23 Brent Everitt

We study Laplacians on graphs and networks via regular Dirichlet forms. We give a sufficient geometric condition for essential selfadjointness and explicitly determine the generators of the associated semigroups on all $\ell^p$, $1\leq p <…

Functional Analysis · Mathematics 2011-04-14 Matthias Keller , Daniel Lenz

The problem of constructing or characterizing strongly regular Cayley graphs (or equivalently, regular partial difference sets) has garnered significant attention over the past half-century. In 2003, Miklavi\v{c} and Poto\v{c}nik [European…

Combinatorics · Mathematics 2025-02-14 Xiongfeng Zhan , Xueyi Huang , Lu Lu

The unitary Cayley graph of $\mathbb Z/n\mathbb Z$, denoted $G_{\mathbb Z/n\mathbb Z}$, is the graph with vertices $0,1,\ldots,$ $n-1$ in which two vertices are adjacent if and only if their difference is relatively prime to $n$. These…

Combinatorics · Mathematics 2018-11-21 Colin Defant

We study some properties of the Cayley graph of the R.Thompson's group F in generators $x_0$, $x_1$. We show that the density of this graph, that is, the least upper bound of the average vertex degree of its finite subgraphs is at least 3.…

Group Theory · Mathematics 2007-05-23 Victor Guba