ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.