Abstract
For a finite permutation group G acting on a set Ω, we say that G is k-free if the set-wise stabilizer of every k-subset of Ω is trivial. The purpose of this article is to describe, for all k, the primitive k-free 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.
