Results 1 to 10 of about 234 (45)
Some of the next articles are maybe not open access.
Primitive Groups with no Regular Orbits on the Set of Subsets
, 1997Á. Seress
semanticscholar +1 more source
Finite Permutation Groups with a Transitive Minimal Normal Subgroup
, 2004J. Bamberg, C. Praeger
semanticscholar +1 more source
The Primitive Permutation Groups of Squarefree Degree
, 2003Caiheng Li, Á. Seress
semanticscholar +1 more source
On minimal subdegrees of finite primitive permutation groups
, 2006Michael Giudici +4 more
semanticscholar +1 more source
Symmetric graphs of valency seven and their basic normal quotient graphs
We characterize seven valent symmetric graphs of order 2pqn2p{q}^{n} with ...
Pan Jiangmin, Huang Junjie, Wang Chao
doaj +1 more source
Base sizes of primitive groups of diagonal type
Let G be a permutation group on a finite set $\Omega $ . The base size of G is the minimal size of a subset of $\Omega $ with trivial pointwise stabiliser in G. In this paper, we extend earlier work of Fawcett by determining the precise base
Hong Yi Huang
doaj +1 more source
A New Look at the Burnside–Schur Theorem [PDF]
The famous Burnside–Schur theorem states that every primitive finite permutation group containing a regular cyclic subgroup is either 2‐transitive or isomorphic to a subgroup of a 1‐dimensional affine group of prime degree.
S. Evdokimov, I. Ponomarenko
semanticscholar +1 more source
A Cayley graph Γ\Gamma on a group G is called a dual Cayley graph on G if the left regular representation of G is a subgroup of the automorphism group of Γ\Gamma (note that the right regular representation of G is always an automorphism group of Γ ...
Pan Jiangmin
doaj +1 more source
The edge-regular complete maps
A map is called edge-regular if it is edge-transitive but not arc-transitive. In this paper, we show that a complete graph Kn{K}_{n} has an orientable edge-regular embedding if and only if n=pd>3n={p}^{d}\gt 3 with p an odd prime such that pd≡3{p}^{d ...
Yu Xue, Lou Ben Gong
doaj +1 more source

