Extremal results regarding K6K_6-minors in graphs of girth at least 5

preprint2010arXivOpen access

Abstract

We prove that every 6-connected graph of girth ≥6\geq 6 has a K6K_6-minor and thus settle the Jorgensen conjecture for graphs of girth ≥6 \geq 6. Relaxing the assumption on the girth, we prove that every 6-connected nn-vertex graph of size ≥31/5n−8\geq 3 1/5 n-8 and of girth ≥5\geq 5 contains a K6K_6-minor.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.