Eulerian paths and a problem concerning \(n\)-arc connected spaces (Q386187)

In this paper, the authors build an example of an \(n\)-arc connected (metric) continuum, which is not a \((n+1)\)-arc connected for every \(n \geq 7\) using Euler's Theorem: A graph has a surjective Eulerian path if and only if it has at most two odd vertices.