Search tip: add tags and a query to focus your search

By
kintali
on
Dec. 3, 2012

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.

[debug] activity: 73.0

By
kintali
on
Aug. 7, 2012
| Updated
on
Aug. 7, 2012

By
kintali
on
May 19, 2013
| Updated
on
May 22, 2013