Distance-transitive representations of the symmetric groups
From MaRDI portal
Publication:1084111
DOI10.1016/0095-8956(86)90051-1zbMath0605.05020OpenAlexW1971276973MaRDI QIDQ1084111
Publication date: 1986
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(86)90051-1
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Symmetric groups (20B30)
Related Items (10)
Finite distance-transitive generalized polygons ⋮ Finite primitive distance-transitive graphs ⋮ Distance-transitive representations of the sporadic groups ⋮ On distance-transitive graphs and involutions ⋮ Graphs on which a dihedral group acts edge-transitively ⋮ On distance transitive graphs whose automorphism groups are affine ⋮ Distance-transitive representations of groups G with \(PSL_ 2(q)\trianglelefteq G\leq P\Gamma L_ 2(q)\) ⋮ Imprimitive distance-transitive graphs with primitive core of diameter at least 3 ⋮ Linear groups and distance-transitive graphs ⋮ Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How many P-polynomial structures can an association scheme have?
- Characterization of the odd graphs \(O_ k \)by parameters
- On the uniqueness of the graphs G(n,k) of the Johnson schemes
- On bipartite tetra0alent graphs
- Antipodal covering graphs
- Finite Permutation Groups and Finite Simple Groups
- Locally petersen graphs
- Distance-Transitive Graphs of Valency Four
- Maximal Subgroups of Symmetric Groups
- On Trivalent Graphs
- PRIMITIVE AND IMPRIMITIVE GRAPHS
- On Tetravalent Graphs
This page was built for publication: Distance-transitive representations of the symmetric groups
