Tverberg Partition Graphs

2023/10/12 by Oliveros, Deborah, Roldán, Érika, Soberón, Pablo +1 · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2310.08563

Abstract

Given a finite set of points in ℝ^d, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given set of points, whose edges describe closeness between different Tverberg partitions. We prove bounds on the minimum and maximum degree of this graph, the number of vertices of maximal degree, its clique number, and its connectedness.

Cited by

• Hall's theorem for reconfigurations and higher dimensional topological connectedness

Related

• A generalization of Tverberg's Theorem
• Quantitative Tverberg theorems over lattices and other discrete sets
• Tverberg-Type Theorems with Trees and Cycles as (Nerve) Intersection Patterns
• Radon partitions in convexity spaces
• Tolerance for colorful Tverberg partitions