7-Connected graphs are 4-ordered

A graph $G$ is $k$-ordered if for any distinct vertices $v_1, v_2, \ldots, v_k \in V(G)$, it has a cycle through $v_1, v_2, \ldots, v_k$ in order. Let $f(k)$ denote the minimum integer so that every $f(k)$-connected graph is $k$-ordered. The first non-trivial case of determining $f(k)$ is when $k=4$, where the previously best known bounds are $7 \leq f(4) \leq 40$. We prove that in fact $f(4)=7$.

[1]  K. Kawarabayashi,et al.  Linkages in Large Graphs of Bounded Tree-Width , 2014, 1402.5549.

[2]  Richard H. Schelp,et al.  Problems in Graph Theory from Memphis , 2013, The Mathematics of Paul Erdős II.

[3]  G. Dirac.  In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen† , 1960 .

[4]  Paul Wollan,et al.  The extremal function for 3-linked graphs , 2008, J. Comb. Theory, Ser. B.

[6]  Gábor N. Sárközy,et al.  On k-ordered Hamiltonian graphs , 1999 .

[7]  Paul Wollan,et al.  An improved linear edge bound for graph linkages , 2005, Eur. J. Comb..

[8]  Paul D. Seymour.  Disjoint paths in graphs , 2006, Discret. Math..

[9]  Matthias Kriesell.  Induced paths in 5-connected graphs , 2001 .

[10]  Wayne Goddard.  4-connected Maximal Planar Graphs Are 4-ordered , 2002, Discret. Math..

[11]  H. Jung.  Eine Verallgemeinerung desn-fachen Zusammenhangs für Graphen , 1970 .

[12]  Alexandr V. Kostochka,et al.  An extremal problem for H‐linked graphs , 2005, J. Graph Theory.

[13]  Xingxing Yu,et al.  Graph Connectivity After Path Removal , 2003, Comb..

[14]  Carsten Thomassen,et al.  2-Linked Graphs , 1980, Eur. J. Comb..

[15]  Xingxing Yu.  Disjoint Paths in Graphs I,¶3-planar Graphs and Basic Obstructions , 2003 .

[16]  Michelle Schultz,et al.  k-ordered Hamiltonian graphs , 1997, J. Graph Theory.

[17]  Yossi Shiloach,et al.  A Polynomial Solution to the Undirected Two Paths Problem , 1980, JACM.

[18]  W. T. Tutte.  How to Draw a Graph , 1963 .

[19]  Xingxing Yu,et al.  Disjoint Paths in Graphs III, Characterization , 2003 .

[20]  Michael D. Plummer,et al.  Linkage for the diamond and the path with four vertices , 2012, J. Graph Theory.

[21]  Ralph J. Faudree,et al.  Survey of results on k-ordered graphs , 2001, Discret. Math..

[22]  Kenta Ozeki,et al.  4-connected Triangulations and 4-orderedness , 2010, Discret. Math..

[23]  Xingxing Yu.  Disjoint Paths in Graphs II,A Special Case , 2003 .

[24]  Ken-ichi Kawarabayashi,et al.  On Sufficient Degree Conditions for a Graph to be $k$-linked , 2006, Combinatorics, Probability and Computing.

[25]  Ronald J. Gould,et al.  A look at cycles containing specified elements of a graph , 2009, Discret. Math..

[26]  Ken-ichi Kawarabayashi,et al.  Non-separating subgraphs after deleting many disjoint paths , 2011, J. Comb. Theory, Ser. B.

[27]  R. Cole.  Two Problems in Graph Theory , 1982 .

[28]  Béla Bollobás,et al.  Highly linked graphs , 1996, Comb..

[29]  Neil Robertson,et al.  Covering Three Edges with a Bond in a Nonseparable Graph , 1980 .