45 research outputs found
Vertex-primitive groups and graphs of order twice the product of two distinct odd primes
A non-Cayley number is an integer n for which there exists a vertex-transitive graph on n vertices which is not a Cayley graph. In this paper, we complete the determination of the non-Cayley numbers of the form 2pq, where p, q are distinct odd primes. Earlier work of Miller and the second author had dealt with all such numbers corresponding to vertex-transitive graphs admitting an imprimitive subgroup of automorphisms. This paper deals with the primitive case. First the primitive permutation groups of degree 2pq are classified. This depends on the finite simple group classification. Then each of these groups G is examined to determine whether there are any non-Cayley graphs which admit G as a vertex-primitive subgroup of automorphisms, and admit no imprimitive subgroups. The outcome is that 2pq is a non-Cayley number, where
A strong geometric hyperbolicity property for directed graphs and monoids
We introduce and study a strong "thin triangle"' condition for directed
graphs, which generalises the usual notion of hyperbolicity for a metric space.
We prove that finitely generated left cancellative monoids whose right Cayley
graphs satisfy this condition must be finitely presented with polynomial Dehn
functions, and hence word problems in NP. Under the additional assumption of
right cancellativity (or in some cases the weaker condition of bounded
indegree), they also admit algorithms for more fundamentally
semigroup-theoretic decision problems such as Green's relations L, R, J, D and
the corresponding pre-orders.
In contrast, we exhibit a right cancellative (but not left cancellative)
finitely generated monoid (in fact, an infinite class of them) whose Cayley
graph is a essentially a tree (hence hyperbolic in our sense and probably any
reasonable sense), but which is not even recursively presentable. This seems to
be strong evidence that no geometric notion of hyperbolicity will be strong
enough to yield much information about finitely generated monoids in absolute
generality.Comment: Exposition improved. Results unchange
Cayley graphs of order 6pq are Hamiltonian
Assume G is a finite group, such that |G| is either 6pq or 7pq, where p and q are distinct prime numbers, and let S be a generating set of G. We prove there is a Hamiltonian cycle in the corresponding Cayley graph on G with connecting set S