Girã o–Lewis–Popielarz conjecture on rainbow saturation of complete graphs
Statement
Let be the complete graph on vertices, let denote the minimum number of edges in an -vertex edge-colored graph containing no rainbow copy of such that adding any non-edge in any color creates a rainbow copy of , and fix . Girã o–Lewis–Popielarz conjecture. There exists a constant depending only on such that, for every ,
The conjecture predicts an exact linear formula for rainbow saturation with infinitely many available colors. It is refuted: for every , the paper establishes constants satisfying and , contradicting the proposed slope .
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.