Bounded-excess connectivity conjecture for Tverberg partition graphs
Statement
Let be a finite set of points in , let be a positive integer, and let denote the Tverberg -partition graph of . Let
The bounded-excess connectivity conjecture. There exists a constant depending only on such that is connected whenever
with . The authors motivate this by the general connectivity bound and computational observations in the plane, and conjecture that the bound 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.