Bannister–Ojakian's shallow topological-minor conjecture for stack-number
Statement
Let and be graphs, and let be a half-integer. A graph is a -shallow topological minor of if a subgraph of is isomorphic to a subdivision of in which each edge is replaced by a path with at most internal vertices. Write for the stack-number of . Bannister–Ojakian's conjecture. There exists a function such that for every graph and half-integer , if is any -shallow topological minor of , then
The conjecture proposed that stack-number is well-behaved under shallow topological minors. It was disproved by Dujmović, Eppstein, Hickingbotham, Morin, and Wood (2021).
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.