A local criterion for Tverberg graphs (Q654004): Difference between revisions

Let \(q\) and \(d\) be two strictly positive integers. A graph \(G\) with \((d+1)(q-1)+1\) vertices is called a \((d,q)\)-Tverberg graph if for any continuous map from a \((d+1)(q-1)\)-simplex to \(\mathbb{R}^d\) one can find disjoint faces \(F_1, F_2,\dots, F_q\) whose images intersect, and moreover vertices adjacent in \(G\) are in different \(F_i\). The set of vertices adjacent to a vertex \(v\) is denoted by \(N(v)\) and the set of vertices on distance two from \(v\) by \(N^2(v)\). The main theorem of the paper gives a local condition on graphs which guarantees that they are Tverberg graphs. More exactly the author proves the following. Theorem: If \(q\) is a prime power and \(G\) a graph with \((d+1)(q-1)+1\) vertices such that \(q > | N^2(v)| +2| N(v)| \), for every vertex \(v\) of \(G\), then \(G\) is a \((d,q)\)-Tverberg graph. A weaker but easily applied corollary follows from the main theorem: If \(q\) is a prime power and \(G\) a graph with \((d+1)(q-1)+1\) vertices such that its maximal degree \(D\) satisfy \(D(D+1)<q\), then \(G\) is a \((d,q)\)-Tverberg graph.