Snark Theorem Equivalent to the 4CT.



The "snark theorem" (paraphrased) says the statement that
"all snarks are non-planar" is equivalent to the 4CT.

The exsitence of a planar snark would prove the 4CT to be false; ie

1, A snark in not 3 edge colorable
2. Therefore the snark is cannot be 4 face colorable,

and the 4CT is false.

But is the absence of a planar snark sufficient to prove the 4CT true?

Bill J

.



Relevant Pages

  • Re: Snark Theorem Equivalent to the 4CT.
    ... The exsitence of a planar snark would prove the 4CT to be false; ... But is the absence of a planar snark sufficient to prove the 4CT true? ... If some snark S happens to be planar, then that graph cannot be 3-edge ...
    (sci.math)
  • Re: Snark Theorem Equivalent to the 4CT.
    ... If some snark S happens to be planar, then that graph cannot be 3-edge ... If C is a snark and C is non-planar, ...
    (sci.math)