The planar graph Markov width conjecture
Statement
Let be a planar graph, and let denote its Markov width.
Planar graph Markov width conjecture. There is a universal constant such that
whenever is planar. Even more strongly, one may take .
The conjecture is motivated by computations for small irreducible graphs and by the bounded-degree Markov bases known for cycles and complete bipartite graphs .
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.