The automorphism group conjecture for the substructure ordering of finite directed graphs
Statement
Let be the partial order of finite directed graphs under the substructure relation . Let denote its automorphism group, and let be the subgroup generated by the explicitly constructed automorphisms , whose structure is
Here is the symmetric group on , and is defined by
The automorphism group conjecture.
Thus the automorphism group of the substructure ordering would have exactly elements, and the conjecture asserts that the constructed subgroup contains all automorphisms of the partial order. The paper proves the stated structure of but does not prove that no additional automorphisms exist.
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.