ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a strongly connected graph. Write H\foldSGH\fold_S G when HH is a synchronizing factor of GG, and let O(G)O(G) denote a candidate minimal synchronizing factor.

O(G)O(G) conjecture. The set of graphs HH with H\foldSGH\fold_S G has a unique \foldS\fold_S-minimal element O(G)O(G).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.