Linear coloring conjecture for touching sets of strings
Statement
A touching set of strings is a finite family of strings in the plane in which no pair crosses, and it is -touching if every point of the plane belongs to at most strings. Linear coloring conjecture. There is a constant such that every -touching set of strings can be colored with colors. The conjecture was subsequently proved by Fox and Pach, who obtained the bound colors.
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.