Erdős Problem #778 — Alice and Bob play a game on the edges of K_n, alternating colouring edges by red (Alice) and blue (Bob).
Statement
Alice and Bob play a game on the edges of , alternating colouring edges by red (Alice) and blue (Bob). Alice goes first, and wins if at the end the largest red clique is larger than any of the blue cliques. Does Bob have a winning strategy for ? (Erd\H{o}s believed the answer is yes.)
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.