A Sane Proof that COLk COL3
Abstract
Let COLk be the set of all k-colorable graphs. It is easy to show that if a<b then COLa COLb (poly time reduction). Using the Cook-Levin theorem it is easy to show that if 3 a< b then COLb COLa. However this proof is insane in that it translates a graph to a formula and then the formula to a graph. We give a simple proof that COLk COL3.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.