In the two-round online edge-coloring game in which the edges of G(n,p) are first colored offline and then N additional random edges are colored online, is it true that for…
Statement
In the two-round online edge-coloring game in which the edges of G(n,p) are first colored offline and then N additional random edges are colored online, is it true that for every 0≤α≤1/6, if p=Ω(n^{-1/2−α}) and N=ω(n^{8α}), then the player loses?
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.