Related papers: Cliques in derangement graphs for innately transit…

We introduce the notion of an \emph{$n$-dimensional mixed dihedral group}, a general class of groups for which we give a graph theoretic characterisation. In particular, if $H$ is an $n$-dimensional mixed dihedral group then the we…

Our main result is that every graph $G$ on $n\ge 10^4r^3$ vertices with minimum degree $\delta(G) \ge (1 - 1 / 10^4 r^{3/2} ) n$ has a fractional $K_r$-decomposition. Combining this result with recent work of Barber, K\"uhn, Lo and Osthus…

In this paper we investigate commuting involution graphs in classical affine Weyl groups. Let $W$ be a classical Weyl group of rank $n$, with $\tilde W$ its corresponding affine Weyl group. Our main result is that if $X$ is a conjugacy…

In this paper we study the realizability question for commuting graphs of finite groups: Given an undirected graph $X$ is it the commuting graph of a group $G$? And if so, to determine such a group. We seek efficient algorithms for this…

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…

Let $G$ be a transitive permutation group of degree $n$. We say that $G$ is $2'$-elusive if $n$ is divisible by an odd prime, but $G$ does not contain a derangement of odd prime order. In this paper we study the structure of quasiprimitive…

The commuting graph of a finite non-commutative semigroup $S$, denoted $\cg(S)$, is a simple graph whose vertices are the non-central elements of $S$ and two distinct vertices $x,y$ are adjacent if $xy=yx$. Let $\mi(X)$ be the symmetric…

In this paper, we study intersecting sets in primitive and quasiprimitive permutation groups. Let $G \leqslant \mathrm{Sym}(\Omega)$ be a transitive permutation group, and ${S}$ an intersecting set. Previous results show that if $G$ is…

The minimal degree of a permutation group $G$ is defined as the minimal number of non-fixed points of a non-trivial element of $G$. In this paper we show that if $G$ is a transitive permutation group of degree $n$ having no non-trivial…

Let $G$ be a finite group, and $S$ be a subset of $G\setminus\{1\}$ such that $S=S^{-1}$. Suppose that $Cay(G,S)$ is the Cayley graph on $G$ with respect to the set $S$ which is the graph whose vertex set is $G$ and two vertices $a,b\in G$…

Let $G$ be a transitive permutation group on a finite set $\Omega$ and recall that a base for $G$ is a subset of $\Omega$ with trivial pointwise stabiliser. The base size of $G$, denoted $b(G)$, is the minimal size of a base. If $b(G)=2$…

The Gruenberg-Kegel graph $\Gamma(G)$ associated with a finite group $G$ has as vertices the prime divisors of $|G|$, with an edge from $p$ to $q$ if and only if $G$ contains an element of order $pq$. This graph has been the subject of much…

Let $G$ be a finite transitive group on a set $\Omega$, let $\alpha\in \Omega$ and let $G_\alpha$ be the stabilizer of the point $\alpha$ in $G$. In this paper, we are interested in the proportion $$\frac{|\{\omega\in \Omega\mid \omega…

The sets of primitive, quasiprimitive, and innately transitive permutation groups may each be regarded as the building blocks of finite transitive permutation groups, and are analogues of composition factors for abstract finite groups. This…

Let $G$ be a Cayley graph of a nonamenable group with spectral radius $\rho < 1$. It is known that branching random walk on $G$ with offspring distribution $\mu$ is transient, i.e., visits the origin at most finitely often almost surely, if…

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…

Let $G$ be a group. \textit{The permutability graph of cyclic subgroups of $G$}, denoted by $\Gamma_c(G)$, is a graph with all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\Gamma_c(G)$ are adjacent if and…

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

A graph is called {\em half-arc-transitive} if its full automorphism group acts transitively on vertices and edges, but not on arcs. It is well known that for any prime $p$ there is no tetravalent half-arc-transitive graph of order $p$ or…

An infinite graph is quasi-transitive if its vertex set has finitely many orbits under the action of its automorphism group. In this paper we obtain a structure theorem for locally finite quasi-transitive graphs avoiding a minor, which is…