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: 51.0

By
kintali
on
June 5, 2012
| Updated
on
June 5, 2012

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

x ### Select What You'd Like To Post

TrueShelf is a unique educational website that focuses on crowdsourcing exercises and puzzles in Mathematics and Computer Science from high school level to graduate level.

© 2013 TrueShelf Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.