The simplicial half-net conjecture for point sets
Statement
Let be a finite point set in . A simplicial half-net is a family of simplices determined by points of such that every halfspace containing at least half the points of contains one of these simplices. Simplicial half-net conjecture. Every point set has a simplicial half-net. The conjecture would extend the lower-bound method based on simplicial half-nets from the planar setting to dimension , potentially removing the restriction from the lower bound for the number of -facets.
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.