Optimal minimum-degree conjecture for Tverberg partition graphs
Statement
Let be a set of points in in strong general position, and let be its Tverberg -partition graph. Write for the minimum degree of this graph, and let
For , the minimum-degree conjecture. The minimum degree is
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.