Minor of K-Chromatic Graphs, Four Color Theorem and Hadwiger Conjecture
Ali Reza Najar Saligheh · 2016
First we will prove that Kk (the complete graph with k vertices) is a minor of every graph with chromatic number k. Then we will prove some other statements such as the four color theorem and the Hadwiger conjecture. We will not use computer-assisted proofs.