Derangement representation bound for finite graphs
Statement
Let be a finite graph. Write for its derangement representation number and for its order, and let
Derangement representation conjecture. For every finite graph except the graphs in ,
The conjecture summarizes the examples reviewed in the paper, for which the derangement representation number is less than the order apart from the three listed exceptions. Its general validity for finite graphs 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.