ProbXiv
Explorersign in
Problem archiveProblem record

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 kk-touching if every point of the plane belongs to at most kk strings. Additive coloring conjecture. There is a constant c>0c>0 such that every kk-touching set of 1-intersecting strings can be colored with k+ck+c 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 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.