Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs (Q1356437): Difference between revisions

A bottleneck in a non-Tait-colourable cubic graph \(G= (V,E)\) is a minimal set \(\mathcal B\) of odd cuts such that, for any \(S\subseteq E\), either \(S\) or \(E\backslash S\) contains at least one member of \(\mathcal B\). F. Holroyd and F. Loupekine conjectured that in any non-Tait-colourable bridgeless cubic graph, the cuts of orders 3 and 5 form a bottleneck. E. Steffen proves that this conjecture is not true for any cyclically 6-edge non-Tait-colourable cubic graph.