English
Related papers

Related papers: On solid density of Cayley digraphs on finite Abel…

200 papers

We introduce the vertex-arboricity of group-labelled graphs. For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose edges are labelled by elements of $\Gamma$. For an abelian group $\Gamma$ and $A\subseteq \Gamma$, the…

Combinatorics · Mathematics 2023-05-03 O-joung Kwon , Xiaopan Lian

A good edge-labelling of a simple graph is a labelling of its edges with real numbers such that, for any ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. Say a graph is good if it admits a good…

Combinatorics · Mathematics 2012-11-13 Abbas Mehrabian

We prove that for every finitely generated group $\Gamma$, at least one of the following holds: (1) $\Gamma$ has fixed price; (2) each of its Cayley graphs $G$ has infinitely many infinite clusters for some Bernoulli percolation on $G$.

Dynamical Systems · Mathematics 2018-09-10 Russell Lyons

Following work of Rieffel, we define the Cayley compactification of an abelian group with specified generating set. We investigate its structure using methods from discrete geometry and commutative algebra.

Combinatorics · Mathematics 2007-05-23 Mike Develin

We study the dilatation of outer automorphisms of right-angled Artin groups. Given a right-angled Artin group defined on a simplicial graph: $A(\Gamma) = \langle V | E \rangle$ and an automorphism $\phi \in Out(A(\Gamma))$ there is a…

Group Theory · Mathematics 2018-11-06 Corey Bregman , Yulan Qing

Let $T_{4p}=\langle a,b\mid a^{2p}=1,a^p=b^2, b^{-1}ab=a^{-1}\rangle$ be the dicyclic group of order $4p$. A Cayley digraph over $T_{4p}$ is called a dicirculant digraph. In this paper, we calculate the number of (connected) dicirculant…

Combinatorics · Mathematics 2024-09-10 Jing Wang , Ligong Wang , Xiaogang Liu

It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…

Logic · Mathematics 2016-02-25 Artem Chernikov , Sergei Starchenko

A dominating (respectively, total dominating) set $S$ of a digraph $D$ is a set of vertices in $D$ such that the union of the closed (respectively, open) out-neighborhoods of vertices in $S$ equals the vertex set of $D$. The minimum size of…

Combinatorics · Mathematics 2020-07-31 Boštjan Brešar , Kirsti Kuenzel , Douglas F. Rall

A vertex transitive graph $\Gamma$ is said to be $2$-distance transitive if for each vertex $u$, the group of automorphisms of $\Gamma$ fixing the vertex $u$ acts transitively on the set of vertices at distance $1$ and $2$ from $u$, while…

Combinatorics · Mathematics 2024-03-05 Jun-Jie Huang , Yan-Quan Feng , Jin-Xin Zhou , Fu-Gang Yin

If $G$ is a group of permutations of a set $\Omega$, then the suborbits of $G$ are the orbits of point-stabilisers $G_\alpha$ acting on $\Omega$. The cardinalities of these suborbits are the subdegrees of $G$. Every infinite primitive…

Group Theory · Mathematics 2013-02-19 Simon M Smith

In this paper, we introduce a new family of graphs, $\Gamma(n,a)$. We show that it is an infinite family of tetravalent half-transitive Cayley graphs. Apart from that, we determine some structural properties of $\Gamma(n,a)$.

Combinatorics · Mathematics 2020-08-19 Sucharita Biswas , Angsuman Das

The codegree Tur\'an density $\gamma(F)$ of a $k$-uniform hypergraph $F$ is the minimum real number $\gamma \ge 0$ such that every $k$-uniform hypergraph on sufficiently many $n$ vertices, in which every set of $k-1$ vertices is contained…

Combinatorics · Mathematics 2025-12-30 Jie Ma , Mingyuan Rong

We study sufficient conditions for the generic rigidity of a graph $G$ expressed in terms of (i) its minimum degree $\delta(G)$, or (ii) the parameter $\eta(G)=\min_{uv\notin E}(\deg(u)+\deg(v))$. For each case, we seek the smallest…

Combinatorics · Mathematics 2025-10-30 Tibor Jordán , Xuemei Liu , Soma Villányi

Consider a discrete locally finite subset $\Gamma$ of $R^d$ and the complete graph $(\Gamma,E)$, with vertices $\Gamma$ and edges $E$. We consider Gibbs measures on the set of sub-graphs with vertices $\Gamma$ and edges $E'\subset E$. The…

Probability · Mathematics 2010-09-17 Pablo A. Ferrari , Eugene A. Pechersky , Valentin V. Sisko , Anatoly A. Yambartsev

We study strongly graded groupoids, which are topological groupoids $\mathcal G$ equipped with a continuous, surjective functor $\kappa: \mathcal G \to \Gamma$, to a discrete group $\Gamma$, such that $\kappa^{-1}(\gamma)\kappa^{-1}(\delta)…

Rings and Algebras · Mathematics 2018-08-17 Lisa Orloff Clark , Roozbeh Hazrat , Simon W. Rigby

Let $\Gamma$ be a locally finite graph, $L$ the normalized Laplacian of $\Gamma$. If $\Gamma$ is uniformy locally finite, i.e. if each vertex has no more than $d$ adjacent vertices, then the matrix of $L$ (with respect to the standard…

Combinatorics · Mathematics 2018-08-14 Vladimir Manuilov

Let $G$ be a group and let $S$ be an inverse-closed and identity-free generating set of $G$. The \emph{Cayley graph} $\Cay(G,S)$ has vertex-set $G$ and two vertices $u$ and $v$ are adjacent if and only if $uv^{-1}\in S$. Let $CAY_d(n)$ be…

Combinatorics · Mathematics 2012-10-23 Primoz Potocnik , Pablo Spiga , Gabriel Verret

A graph is \textit{rigid} if it only admits the identity endomorphism. We show that for every $d\ge 3$ there exist infinitely many mutually rigid $d$-regular graphs of arbitrary odd girth $g\geq 7$. Moreover, we determine the minimum order…

Combinatorics · Mathematics 2025-02-18 Kolja Knauer , Gil Puig i Surroca

We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic…

Differential Geometry · Mathematics 2016-03-22 Roberto Frigerio , Jean-Francois Lafont , Alessandro Sisto

Inspired by an example of Gueritaud-Kassel [Geom. Topol. 2017], we construct a family of infinitely generated discontinuous groups $\Gamma$ for the 3-dimensional anti-de Sitter space $\mathrm{AdS}^{3}$. These groups are not necessarily…

Group Theory · Mathematics 2023-12-04 Kazuki Kannaka