A combinatorial approach to transitive extensions of generously unitransitive permutation groups

DOI10.1002/jcd.20250zbMath1205.05250OpenAlexW1980594718MaRDI QIDQ3057081

Andrew J. Woldar, Dale M. Mesner, Mikhail H. Klin

Publication date: 24 November 2010

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20250

zbMATH Keywords

association schemepermutation groupHamming schemetriangular graphtransitive extensionassociation scheme on triplestriple design\(k\)-orbit3-homogeneous graphgenerously unitransitive

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (3)

The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures ⋮ Circulant association schemes on triples ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some packings with Steiner triple systems
• Graphical \(t\)-designs via polynomial Kramer-Mesner matrices
• A ternary algebra arising from association schemes on triples
• Association schemes on triples and a ternary algebra
• On transitive extensions of finite permutation groups
• Generosity and Characters of Multiply Transitive Permutation Groups
• The Graph Extension Theorem

This page was built for publication: A combinatorial approach to transitive extensions of generously unitransitive permutation groups