Beck's Chooser-Picker conjecture
Statement
Let be a hypergraph. Suppose that Breaker wins the Maker-Breaker game on , with Maker moving first. Beck's Chooser-Picker conjecture. Picker wins the Chooser-Picker game on . This conjecture compares the relative difficulty of the Maker-Breaker and Chooser-Picker games on the same hypergraph. It is refuted by a construction in this paper: there is a hypergraph on which Breaker wins the Maker-Breaker game while Chooser wins the Chooser-Picker game.
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.