Conjecture on fixing numbers of symmetric groups
Statement
Let be the symmetric group on letters, and let denote the set of possible numbers of vertices that fix a graph whose automorphism group is . Fixing-number conjecture.
The conjecture is motivated by the exact values in the first four rows of the paper's table, while the subsequent rows only provide lower and upper bounds; its resolution is not specified here.
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.