ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A bipartite circle graph is a circle graph whose vertices can be divided into two parts such that edges join only vertices in different parts. A graph HH is a pivot-minor of GG if it can be obtained from GG by pivotings and vertex deletions, and the rank-width of GG is its graph rank-width. Oum's rank-width conjecture. For every bipartite circle graph HH, every graph GG of sufficiently large rank-width contains a pivot-minor isomorphic to HH. This conjecture proposes a universal obstruction principle linking large rank-width to prescribed bipartite circle-graph pivot-minors; its general status is not resolved in the source.

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.