The planar scramble-number bound problem
Statement
There exists a constant such that, for every integer and every simple planar graph with , its scramble number satisfies ; equivalently, every simple planar graph has scramble number .
Record
- Added
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.