- Full text PDF available (17)
- This year (0)
- Last 5 years (12)
- Last 10 years (21)
Journals and Conferences
A semilinear space S is a non-empty set of elements called points, provided with a collection of subsets called lines such that any pair of points is contained in at most one line and every line contains at least two points. Two points p and q are said to be collinear if p 6 q and if the pair f p; qg is contained in a line; the line containing two… (More)
Two different constructions are given of a rank 8 arc-transitive graphwith 165 vertices and valency 8,whose automorphismgroup isM11. One involves 3-subsets of an 11-set while the other involves 4-subsets of a 12-set, and the constructions are linkedwith theWitt designs on 11, 12 and 24 points. Four different constructions are given of a rank 9… (More)
A Latin square design whose automorphism group is transitive of rank at most 3 on points must come from the multiplication table of an elementary abelian p-group,
A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all transitive decompositions of the Johnson graphs such that the group preserving the partition is arc-transitive and acts primitively on the parts.
A partial linear space is a non-empty set of points, provided with a collection of subsets called lines such that any pair of points is contained in at most one line and every line contains at least two points. Graphs and linear spaces are particular cases of partial linear spaces. A partial linear space which is neither a graph nor a linear space is called… (More)
An S3-involution graph for a group G is a graph with vertex set a union of conjugacy classes of involutions of G such that two involutions are adjacent if they generate an S3-subgroup in a particular set of conjugacy classes. We investigate such graphs in general and also for the case where G = PSL(2, q).
A classification is given of rank 3 group actions which are quasiprimitive but not primitive. There are two infinite families and a finite number of individual imprimitive examples. When combined with earlier work of Bannai, Kantor, Liebler, Liebeck and Saxl, this yields a classification of all quasiprimitive rank 3 permutation groups. Our classification is… (More)