Print LaTeX

2-connectivity and bipartite minors

Prove that for every integer $t$ there exists an integer $n$ such that every 2-connected graph on at least $n$ vertices has either a cycle of length at least $t$ or a $K_{2,t}$ minor.

Source: folklore
delete flag offensive retag edit Add to a Problem Set

Related books