Complete maximal identity conjecture for Cartesian products of paths
Statement
Let denote the path graph with vertices, and let denote the Cartesian product of graphs. For with , consider . A graph has the complete maximal identity property if its maximal stable configuration is equivalent to the identity for every choice of sink.
Path-product conjecture. The only graphs with the complete maximal identity property are when , together with , which is .
The conjecture was supported by a SageMath verification for . The proposition establishing the listed cases is proved in the paper, but the exclusion of all other path products 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.