Farber's conjecture for planar graphs (Q2238222)

Let \(X\) be a space and \(\mathrm{Conf}_k(X)\) be the configuration space of \(k\)-tuples, \(\mathrm{Conf}_k(X)=\{(x_1, \ldots ,x_k)\mid x_i\in X, x_i\neq x_j \text{ if } i\neq j\}\). Let \(\Gamma\) be a connected planar graph and \(m(\Gamma)\) the number of essential vertices of \(\Gamma\). Theorem. If \(m(\Gamma)\geq 2\) and \(k\geq 2m(\Gamma)\) then \( \mathrm{TC}_r\mathrm{Conf}_k(\Gamma)=rm(\Gamma), \) where \(\mathrm{TC}_r\) denotes the \(r\)th topological complexity.