Home » Keyword index

graph minors


Graph Theory » Basic G.T. » Minors

Forcing a $K_6$-minor ★★

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

Conjecture   Every graph with minimum degree at least 7 contains a $ K_6 $-minor.
Conjecture   Every 7-connected graph contains a $ K_6 $-minor.

Keywords: connectivity; graph minors

Posted by David Wood
updated January 16th, 2012
add new comment
Syndicate content