The O(G) conjecture on minimal synchronizing factors
Statement
Let be a strongly connected graph. Write when is a synchronizing factor of , and let denote a candidate minimal synchronizing factor.
conjecture. The set of graphs with has a unique -minimal element .
This conjecture asserts that every strongly connected graph has a well-defined canonical minimal synchronizing factor. It is known in several classes, including graphs related to the road-colouring theorem and almost bunchy graphs, but is open in general.
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.