7-Connected Graphs are 4-Ordered

Rose McCarty, Yan Wang, Xingxing Yu

A graph $G$ is $k$-ordered if for any distinct vertices $v_1,v_2,\dots ,v_k\in V(G)$, it has a cycle through $v_1,v_2,\dots ,v_k$ in order. Let $f(k)$ denote the minimum int…