ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be a finite set of points in \mathdsRd\mathds{R}^d, let rr be a positive integer, and let GT[S,r]G_T[S,r] denote the Tverberg rr-partition graph of SS. Let

Tv⁡(d,r)=(d+1)(r−1)+1.\operatorname{Tv}(d,r)=(d+1)(r-1)+1.

The bounded-excess connectivity conjecture. There exists a constant k(d)k(d) depending only on dd such that GT[S,r]G_T[S,r] is connected whenever

∣S∣≥Tv⁡(d,r)+k(d),|S|\geq \operatorname{Tv}(d,r)+k(d),

with k(1)=1k(1)=1. The authors motivate this by the general connectivity bound and computational observations in the plane, and conjecture that the bound 3Tv⁡(d,r)−13\operatorname{Tv}(d,r)-1 is not optimal; the source does not resolve the existence of such a dimension-dependent constant.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.