![](/files/happy5.png)
graph minors
Forcing a $K_6$-minor ★★
Author(s): Barát ; Joret; Wood
Conjecture Every graph with minimum degree at least 7 contains a
-minor.
![$ K_6 $](/files/tex/ba39f6d33baf4500a21bc1905745d7c0414444e6.png)
Conjecture Every 7-connected graph contains a
-minor.
![$ K_6 $](/files/tex/ba39f6d33baf4500a21bc1905745d7c0414444e6.png)
Keywords: connectivity; graph minors
![Syndicate content Syndicate content](/misc/feed.png)
Author(s): Barát ; Joret; Wood
Keywords: connectivity; graph minors