Finite primitive groups and edge-transitive hypergraphs
From MaRDI portal
Publication:289049
DOI10.1007/S10801-015-0651-9zbMATH Open1336.05061arXiv1407.0953OpenAlexW1648017160MaRDI QIDQ289049FDOQ289049
Authors: Pablo Spiga
Publication date: 27 May 2016
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Abstract: We determine all finite primitive groups that are automorphism groups of edge-transitive hypergraphs. This gives an answer to a problem proposed by Babai and Cameron
Full work available at URL: https://arxiv.org/abs/1407.0953
Recommendations
- Most primitive groups are full automorphism groups of edge-transitive hypergraphs.
- On edge-primitive 2-arc-transitive graphs
- The finite primitive groups with soluble stabilizers, and the edge-primitive \(s\)-arc transitive graphs.
- Finite vertex primitive 2-arc transitive graphs admitting a two-dimensional linear group
- One class of primitive 2-arc transitive graphs.
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Hypergraphs (05C65) Primitive groups (20B15) Other matrix groups over finite fields (20H30)
Cites Work
- The Magma algebra system. I: The user language
- The maximal subgroups of the low-dimensional finite classical groups.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On groups with no regular orbits on the set of subsets
- Title not available (Why is that?)
- Primitive Groups with no Regular Orbits on the Set of Subsets
- Title not available (Why is that?)
- A classification of the maximal subgroups of the finite alternating and symmetric groups
- \(k\)-homogeneous groups
- The Inclusion Problem for Finite Primitive Permutation Groups
- A characterization of some locally finite simple groups of Lie type
- On the minimal degree of a primitive permutation group
- OVERGROUPS OF PRIMITIVE GROUPS
- Minimal Degrees of Primitive Permutation Groups, with an Application to Monodromy Groups of Covers of Riemann Surfaces
- Orbit equivalence and permutation groups defined by unordered relations.
- Most primitive groups are full automorphism groups of edge-transitive hypergraphs.
- The probability of generating the symmetric group
- Overgroups of primitive groups. II.
Cited In (9)
- Title not available (Why is that?)
- The finite primitive groups with soluble stabilizers, and the edge-primitive \(s\)-arc transitive graphs.
- Orbit closed permutation groups, relation groups, and simple groups
- Primitive Permutation Groups with a Common Suborbit, and Edge-Transitive Graphs
- Geometric groups of second order and related combinatorial structures
- Boolean lattices in finite alternating and symmetric groups
- Most primitive groups are full automorphism groups of edge-transitive hypergraphs.
- Edge-primitive graphs of prime power order
- How far can edge transitivity in hypergraphs be?
Uses Software
This page was built for publication: Finite primitive groups and edge-transitive hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289049)