ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a planar graph, and let mu(G)mu(G) denote its Markov width.

Planar graph Markov width conjecture. There is a universal constant CC such that

μ(G)≤C\mu(G) \leq C

whenever GG is planar. Even more strongly, one may take C=6C=6.

The conjecture is motivated by computations for small irreducible graphs and by the bounded-degree Markov bases known for cycles and complete bipartite graphs K2,nK_{2,n}.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.