In the biased positional games on the edges of K_n, determine the unresolved threshold questions recorded in the report: close the remaining gap for the Breaker bias at which…
Statement
In the biased positional games on the edges of K_n, determine the unresolved threshold questions recorded in the report: close the remaining gap for the Breaker bias at which Maker can build a Hamilton cycle; determine the threshold bias when Maker's goal is a perfect matching; determine the threshold bias for Maker to build a k-connected graph; determine the threshold bias for the Avoider–Enforcer Hamiltonicity game; and decide whether that latter threshold exists at all. The report also records the related question whether Enforcer, with bias (1−o(1))n/log n, can force Avoider with bias 1 to build a Hamilton cycle, while noting that this particular question was subsequently resolved affirmatively.
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.