Section problems for graph configuration spaces (Q2049860)

Let \(G\) be a finite graph, that is, a finite connected \(1\)-dimensional cell complex and let \(Conf_n(G)=\{(x_1,\ldots,x_n)\in G^n:~ x_i\neq x_j \text{ for } i\neq j\}\) denote the \(n\)-th ordered configuration space of \(G\). Furthermore, consider the forgetting map \(\phi_{n+1}:Conf_{n+1}(G)\to Conf_n(G)\) given by \(\phi_{n+1}(x_1,\ldots,x_{n},x_{n+1})=(x_1,\ldots,x_n)\). A section of \(\phi_{n+1}\) is a continuous map \(s:Conf_n(G)\to Conf_{n+1}(G)\) such that \(\phi_{n+1}\circ s=1_{Conf_n(G)}\), where \(1_{Conf_n(G)}\) denotes the identity map. \vspace{0.5cm} The principal Theorems of this paper are as follows: \vspace{0.5cm}\noindent \textbf{Theorem 1.1.} For any finite graph \(G\) with \(\chi(G)<0\) and natural number \(n\) with \(n\geq 2-\chi(G)\), no section of \(\phi_{n+1}\) exists. \vspace{0.5cm} \noindent \textbf{Theorem 1.2.} For any finite graph \(G\) with \(\chi(G)=0\), a section of \(\phi_{n+1}\) exists for all natural numbers \(n\). \vspace{0.5cm}\noindent \textbf{Theorem 1.3}. For any finite graph \(G\) with \(\chi(G)=1\), a section of \(\phi_{n+1}\) exists if and only if \(n\geq 2\). \vspace{0.5cm} In addition, the author also shows that when \(\chi(G)<0\) and \(n< 2-\chi(G)\), then a section of \(\phi_{n+1}\) may or may not exist by providing examples of both cases.