In graph-construction games with highly irregular target graphs, can Maker use a global strategy that postpones deciding which board vertex represents which vertex of the…
Statement
In graph-construction games with highly irregular target graphs, can Maker use a global strategy that postpones deciding which board vertex represents which vertex of the target G, and thereby obtain an asymptotically faster construction than local strategies?
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.