![](/files/happy5.png)
minors
List Hadwiger Conjecture ★★
Author(s): Kawarabayashi; Mohar
Conjecture Every
-minor-free graph is
-list-colourable for some constant
.
![$ K_t $](/files/tex/7a86d3ef1cad6ecf4b2ce1338d254d4b623a47d1.png)
![$ c t $](/files/tex/4ea6f9eaee0b554ac0634a6b2eb25aab03ddadd1.png)
![$ c\geq1 $](/files/tex/d63769e74f2afc1d88e278fcb992d7ac545efcdc.png)
Keywords: Hadwiger conjecture; list colouring; minors
Forcing a 2-regular minor ★★
Conjecture Every graph with average degree at least
contains every 2-regular graph on
vertices as a minor.
![$ \frac{4}{3}t-2 $](/files/tex/e3058b3a3212b3db0404690975e13ff4036eafd0.png)
![$ t $](/files/tex/4761b031c89840e8cd2cda5b53fbc90c308530f3.png)
Keywords: minors
![Syndicate content Syndicate content](/misc/feed.png)