Resistance, oddness and colouring defect of snarks

Let G be a bridgeless cubic graph. The resistance of G, denoted r (G), is the minimum number of edges which can be removed from G in order to render 3-edge-colourability. The oddness of G, denoted (G), is the minimum number of odd components in a 2-factor of G. The colouring defect of G (or simply, the defect of G), denoted ₃ (G), is the minimum number of edges not contained in any set of three perfect matchings of G. These three parameters are regarded as measurements of uncolourability of snarks, partly because any one of these parameters equal zero if and only if G is 3-edge-colourable. It is also known that r (G) (G) and that ₃ (G) 32 (G) fiol, jinsteffen. We have shown that the ratio of oddness to resistance can be arbitrarily large for non-trivial snarks allie1. It has also been shown that the ratio of the defect to oddness can be arbitrarily large for non-trivial snarks, although this result was only shown for graphs with oddness equal to 2 karabasetal. In the same paper, the question was posed whether there exists non-trivial snarks for given resistance r or given oddness, and arbitrarily large defect. In this paper, we prove a stronger result: For any positive integers r 2, even r, and d 32, there exists a non-trivial snark G with r (G) =r, (G) = and ₃ (G) d.