# graph minors

## Forcing a $K_6$-minor ★★

Author(s): Barát ; Joret; Wood

\begin{conjecture} Every graph with minimum degree at least 7 contains a $K_6$-minor. \end{conjecture}

\begin{conjecture} Every 7-connected graph contains a $K_6$-minor. \end{conjecture}

Keywords: connectivity; graph minors