Infinite families of crossing-critical graphs with a given crossing number (Q790825)

The author proves that, for each natural number \(n\geq 3\), there are infinitely many 3-connected graphs which have crossing number n and which are minimal under this restriction. He conjectures that, for \(n=2\), there are only finitely many such graphs. For \(n=1\), there are only two such graphs by Kuratowski's theorem.