Abstract
Abstract We solve the long-standing open problem of classifying all 3-(v, k, 1) designs with a flag-transitive group of automorphisms (cf. [11], p. 147, and [12], p. 273, but presumably dating back to 1965). Our result relies on the classification of the finite 2-transitive permutation groups.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
