A local criterion for Tverberg graphs

DOI10.1007/S00493-011-2665-9zbMATH Open1249.05076arXiv1002.3447OpenAlexW2128244265MaRDI QIDQ654004FDOQ654004

Authors: Alexander Engström 

Publication date: 20 December 2011

Published in: Combinatorica (Search for Journal in Brave)

Abstract: The topological Tverberg theorem states that for any prime power q and continuous map from a (d+1)(q-1)-simplex to R}^d, there are q disjoint faces F_i of the simplex whose images intersect. It is possible to put conditions on which pairs of vertices of the simplex that are allowed to be in the same face F_i. A graph with the same vertex set as the simplex, and with two vertices adjacent if they should not be in the same F_i, is called a Tverberg graph if the topological Tverberg theorem still work. These graphs have been studied by Hell, Schoneborn and Ziegler, and it is known that disjoint unions of small paths, cycles, and complete graphs are Tverberg graphs. We find many new examples by establishing a local criterion for a graph to be Tverberg. An easily stated corollary of our main theorem is that if the maximal degree of a graph is D, and D(D+1)<q, then it is a Tverberg graph. We state the affine versions of our results and also describe how they can be used to enumerate Tverberg partitions.

Full work available at URL: https://arxiv.org/abs/1002.3447

Recommendations

• Tverberg's theorem and graph coloring
• Tverberg's theorem with constraints
• scientific article; zbMATH DE number 718867
• Note on the colored Tverberg theorem
• Tverberg's theorem, disks, and Hamiltonian cycles

zbMATH Keywords

\((d,q)\)-Tverberg graphcartesian product of two graphsreduction lemma

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Cites Work

• Title not available (Why is that?)
• Algebraic properties of edge ideals via combinatorial topology
• Shellability of chessboard complexes
• Chessboard Complexes and Matching Complexes
• A Generalization of Radon's Theorem
• Independence complexes of claw-free graphs
• On a Topological Generalization of a Theorem of Tverberg
• Note on a conjecture of Sierksma
• Optimal bounds for the colored Tverberg problem
• Tverberg partitions and Borsuk-Ulam theorems.
• Optimal bounds for a colorful Tverberg-Vrećica type problem
• On the number of Tverberg partitions in the prime power case
• Tverberg's theorem with constraints
• The topological Tverberg theorem and winding numbers

Cited In (8)

• Intersecting diametral balls induced by a geometric graph
• Distance \(r\)-domination number and \(r\)-independence complexes of graphs
• Projective center point and Tverberg theorems
• Chordal graphs, higher independence and vertex decomposable complexes
• Star clusters in independence complexes of graphs
• A local intersection condition for \(n\)-extendable graphs
• Tverberg's theorem and graph coloring
• Fair splittings by independent sets in sparse graphs

This page was built for publication: A local criterion for Tverberg graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654004)