(English)Manuscript (Other academic)
The topological Tverberg theorem states that for any prime powerq and continuous map from a (d + 1)(q − 1)-simplex to Rd, there are qdisjoint faces Fi of the simplex whose images intersect. It is possible toput conditions on which pairs of vertices of the simplex that are allowed tobe in the same face Fi. A graph with the same vertex set as the simplex,and with two vertices adjacent if they should not be in the same Fi, iscalled a Tverberg graph if the topological Tverberg theorem still work. Aconsequence of our main theorem is that if the maximal degree of a graphis D, and D(D + 1) < q, then it is a Tverberg graph.
IdentifiersURN: urn:nbn:se:kth:diva-10370OAI: oai:DiVA.org:kth-10370DiVA: diva2:216349
QC 201007122009-05-082009-05-082010-07-12Bibliographically approved