The blocker number of simple drawings of complete graphs
Statement
A drawing of a graph represents vertices by distinct plane points and edges by simple curves, with a vertex meeting an edge only at an endpoint. A drawing is simple if any two edges intersect at most once, either at a common endpoint or at a proper crossing. A set of points blocks a drawing if it contains no vertex and every edge contains a blocker. Simple-drawing blocker conjecture. The minimum number of blockers in a simple drawing of equals . A construction gives an upper bound of , while the general lower bound stated in the source is only ; the conjectured exact value remains open.
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.