ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be a set of nn points in \mathdsRd\mathds{R}^d in strong general position, and let GT[S,r]G_T[S,r] be its Tverberg rr-partition graph. Write δ(GT[S,r])\delta(G_T[S,r]) for the minimum degree of this graph, and let

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

For n>Tv⁡(d,r)n>\operatorname{Tv}(d,r), the minimum-degree conjecture. The minimum degree is

δ(GT[S,r])=(n+1−Tv⁡(d,r))(r−1).\delta(G_T[S,r])=(n+1-\operatorname{Tv}(d,r))(r-1).

The paper has established lower and upper degree bounds, and this conjecture asserts that the lower bound is attained for every strongly general-position configuration. Its resolution is not given in the source.

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.