The 8/9-density conjecture for monochromatic paths
Statement
Let be the complete graph on the positive integers, and define the upper density of a vertex set by . The upper density of a path is the upper density of its vertex set. The 8/9-density conjecture. Every -coloring of contains a monochromatic path of upper density at least . The bound would be best possible by the example cited in the source.
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.