ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be the complete graph on nn vertices. In a (q:1)(q:1) Waiter–Client game on E(Kn)E(K_n), Waiter offers q+1q+1 unclaimed edges in each round, and Client claims one offered edge while Waiter claims the others. Acyclic Client graph conjecture. For any constant ε>0\varepsilon>0 and integer q≥(1+ε)nq\geq(1+\varepsilon)n, Client has a strategy to keep his graph acyclic.

This conjecture asserts that the proved sufficient condition q≥1.1nq\geq1.1n can be extended to every fixed margin above nn. The paper proves that Waiter can force Client to build a cycle when q≤(1−ε)nq\leq(1-\varepsilon)n, while Client's strategy is established only for the larger constant 1.11.1; 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.