Additive coloring conjecture for 1-intersecting touching strings
Statement
A 1-intersecting set of strings is a set of strings in which any two strings intersect in at most one point, and it is -touching if every point of the plane belongs to at most strings. Additive coloring conjecture. There is a constant such that every -touching set of 1-intersecting strings can be colored with colors. No resolution is supplied in the source excerpt.
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.