First time here? Check out the FAQ!
posted Dec 03 '12
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.
Posted: Dec 03 '12
Seen: 41 times
Last updated: Dec 03 '12
Minimum Flip Connectivity Problem
Edge connectivity vs Strong connectivity
Planar graphs and grid minors
Connectivity of cubic graphs
Cycle in k-connected graphs
Petersen’s theorem
Halin's theorem and Mader's theorem
k-regular bipartite graphs are 2-connected
Properties of Petersen Graph
Orienting a Planar Graph
Graceful Tree Conjecture
