ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each nn, consider the collection of graphs on nn 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 P1{\rm P}{1}-win graphs on nn vertices tends to 00 as n→∞n\to\infty. The paper notes that most small graphs are P2{\rm P}{2}-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 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.