The Order of Long Rainbow Arithmetic Progressions
Statement
Let be the least such that every equinumerous -coloring of contains a rainbow -term arithmetic progression. Jungic, Licht, Mahdian, Nesetril and Radoicic conjectured ; Conlon, Fox and Sudakov proved . The matching lower bound holds, so and the conjectured order is wrong.
Context
the true order is determined, and it is not the conjectured one
A 2003 Combinatorics, Probability and Computing conjecture in anti-Ramsey theory that Conlon, Fox and Sudakov had already worked on, well known within extremal combinatorics.
People
Attempts
No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
The acknowledgement says the two systems were used for proof exploration, proof criticism, exposition and revision. Proof exploration and criticism are mathematical work rather than prose work, but no specific step is attributed, so the lowest tier applies.
the true order is determined, and it is not the conjectured one
Reviews
No person has reviewed this attempt. It has not been checked at all.
Discussion of this attempt
no comments
Solve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.
Discussion
Nothing has been said about this problem yet.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.