The semiprimitivity characterization of graph-restrictive permutation groups
Statement
Let be a transitive permutation group. It is semiprimitive if each of its normal subgroups is either transitive or semiregular, and it is graph-restrictive if there exists a constant such that, for every connected locally- pair and every arc of , one has . Semiprimitivity characterization conjecture. A permutation group is graph-restrictive if and only if it is semiprimitive. The conjecture seeks a characterization of graph-restrictive groups and, in the source, is motivated by results extending methods for primitive groups to semiprimitive groups; its resolution is not stated there.
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.