The obstacle-number graph-counting conjecture
Statement
Let denote the number of -vertex graphs with obstacle number at most . The function satisfies .
Obstacle-number graph-counting conjecture. The number of such graphs satisfies
An improved upper bound on the dependence of the counting function on would improve lower bounds for the worst-case obstacle number of graphs. The paper presents this as a conjectural direction; no resolution is given.
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.