conjecture. Conjecture 2.
Statement
conjecture. Conjecture 2. Every proper pivot-minor-closed class of graphs is polynomially χ-bounded. The discussed natural classes closed under pivot-minors are all polynomially χ-bounded. For circle graphs this was proved by Davies and McCarty [5], and furthermore it is now know that they have a χ-bounding function of Θ(\omega log \omega) [3, 11]. Bonamy and Pilipczuk [1] proved that graphs of bounded rank-width are polynomially χ-bounded. We also report on an extension of Vizing’s theorem that pivot-minors of line graphs (a class distinct from the class of lines graphs and the class of all graphs) with clique number \omega are \omega + 1 colourable. The report passage is retained verbatim as the relevant context for this extracted problem.
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.