Oum's rank-width conjecture for bipartite circle graphs
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 is a pivot-minor of if it can be obtained from by pivotings and vertex deletions, and the rank-width of is its graph rank-width. Oum's rank-width conjecture. For every bipartite circle graph , every graph of sufficiently large rank-width contains a pivot-minor isomorphic to . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.