Article

K6 Minors in Large 6-Connected Graphs

03/2012;
Source: arXiv

ABSTRACT

Jorgensen conjectured that every 6-connected graph with no K_6 minor has a
vertex whose deletion makes the graph planar. We prove the conjecture for all
sufficiently large graphs.

Full-text

Available from: Sergey Norin, Oct 01, 2015
0 Followers
·
• Source
• "We shall use the following theorem, which was proved in [4], to prove the main theorem of this section. We present a simplified restatement of it. "
Article: Excluding subdivisions of bounded degree graphs
[Hide abstract]
ABSTRACT: Let $H$ be a fixed graph. What can be said about graphs $G$ that have no subgraph isomorphic to a subdivision of $H$? Grohe and Marx proved that such graphs $G$ satisfy a certain structure theorem that is not satisfied by graphs that contain a subdivision of a (larger) graph $H_1$. Dvo\v{r}\'ak found a clever strengthening---his structure is not satisfied by graphs that contain a subdivision of a graph $H_2$, where $H_2$ has "similar embedding properties" as $H$. Building upon Dvo\v{r}\'ak's theorem, we prove that said graphs $G$ satisfy a similar structure theorem. Our structure is not satisfied by graphs that contain a subdivision of a graph $H_3$ that has similar embedding properties as $H$ and has the same maximum degree as $H$. This will be important in a forthcoming application to well-quasi-ordering.
• Source
• "We then analyze how the remainder of the graph attaches to the grid. We refer to [10] for details. "
Article: K_6 minors in 6-connected graphs of bounded tree-width
[Hide abstract]
ABSTRACT: We prove that every sufficiently big 6-connected graph of bounded tree-width either has a K_6 minor, or has a vertex whose deletion makes the graph planar. This is a step toward proving that the same conclusion holds for all sufficiently big 6-connected graphs. Jorgensen conjectured that it holds for all 6-connected graphs.
• Source
• "In this, we follow much of the recent work analyzing the existence of clique minors in large graphs. See [1] [2] [3] [7]. The bounded tree-width case is easy: "
Article: The Erdős–Pósa property for clique minors in highly connected graphs
[Hide abstract]
ABSTRACT: We prove the existence of a function f:N2→N such that, for all p,k∈N, every (k(p−3)+14p+14)-connected graph either has k disjoint Kp-minors or contains a set of at most f(p,k) vertices whose deletion kills all its Kp-minors. For fixed p⩾5, the connectivity bound of about k(p−3) is smallest possible, up to an additive constant: if we assume less connectivity in terms of k, there will be no such function f.
Journal of Combinatorial Theory Series B 03/2010; 102(2). DOI:10.1016/j.jctb.2011.08.001 · 0.98 Impact Factor