The asymptotic rarity conjecture for first-player wins in Trail Trap
Statement
For each , consider the collection of graphs on vertices and the subset consisting of graphs on which the first player has a winning strategy in Trail Trap. Asymptotic rarity conjecture. The proportion of -win graphs on vertices tends to as . The paper notes that most small graphs are -win, but provides no proof of this asymptotic assertion.
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.