Potočnik–Spiga–Verret's semiprimitive graph-restrictiveness conjecture
Statement
Let be a finite permutation group. Call semiprimitive if every normal subgroup of is transitive or semiregular, and call graph-restrictive if there is a constant such that, for every locally pair , the order of a vertex stabiliser in is at most . Potočnik–Spiga–Verret's conjecture.
This is the graph-theoretic problem motivating the paper and is described there as potentially the most intractable problem in the section; the forward implication remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.