1 problem

A graph on $n$ vertices is controllable in the sense of Godsil if its associated controllability matrix has full rank. Godsil's conjecture. The proportion of graphs on $n$ vertices…