Combinatorics and Graph Theory


Minor of K-Chromatic Graphs, Four Color Theorem and Hadwiger Conjecture

Authors: Ali Reza Najar Saligheh

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.

Comments: 6 Pages. English and French languages.

Download: PDF

Submission history

[v1] 2016-03-15 07:27:51

Unique-IP document downloads: 41 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus