On $k$-connectivity oracles in $k$-connected graphs

Abstract

A $k$-connectivity oracle for a graph $G=(V,E)$ is a data structure that given $s,t\in V$ determines whether there are at least $k+1$ internally disjoint $st$-paths in $G$. For undirected graphs, Pettie, Saranurak & Yin [STOC 2022, pp. 151-161] proved that any $k$-connectivity oracle requires $\hat{I}\text{c◯}(kn)$ bits of space. They asked whether $\hat{I}\text{c◯}(kn)$ bits are still necessary if $G$ is $k$-connected. We will show by a very simple proof that this is so even if $G$ is $k$-connected, answering this open question.