2 papers
math.CO2010
Extremal results regarding -minors in graphs of girth at least 5
Elad Aigner-Horev, Roi Krakovski
We prove that every 6-connected graph of girth has a -minor and thus settle the Jorgensen conjecture for graphs of girth . Relaxing the assumption on the gir…
math.CO2010
The Kelmans-Seymour conjecture for apex graphs
Elad Aigner-Horev, Roi Krakovski
We provide a short proof that a 5-connected nonplanar apex graph contains a subdivided or a (= with a single edge removed) as a subgraph. Together with…