Advertisements

Recent Posts
Archives
Categories
Meta
Let be a finite, simple, undirected graph. Hadwiger’s conjecture states that if then is a minor of . Let’s call that statement (Hadw). We show that it is equivalent to the following statement: (Hadw’): If is not a complete graph, … Continue reading