The acyclic Client graph conjecture for the Waiter–Client game
Statement
Let be the complete graph on vertices. In a Waiter–Client game on , Waiter offers unclaimed edges in each round, and Client claims one offered edge while Waiter claims the others. Acyclic Client graph conjecture. For any constant and integer , Client has a strategy to keep his graph acyclic.
This conjecture asserts that the proved sufficient condition can be extended to every fixed margin above . The paper proves that Waiter can force Client to build a cycle when , while Client's strategy is established only for the larger constant ; the asymptotically tight threshold remains open.
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.