1 problem

The $O(G)$ conjecture on minimal synchronizing factors
$O(G)$ conjecture. The set of graphs $H$ with $H\fold_S G$ has a unique $\fold_S$ -minimal element $O(G)$ .
opendirected-graphs road-colouring synchronizing-automata
0 responses
07

The O(G)O(G)O(G) conjecture on minimal synchronizing factors