Strong pivot-minor Erdős–Hajnal conjecture
Statement
Let be a graph. A set of vertices is complete to a disjoint set if every vertex of is adjacent to every vertex of , and anti-complete if no such edges exist. Strong pivot-minor Erdős–Hajnal conjecture. For every graph , there exists such that, for every , every -vertex graph with no pivot-minor isomorphic to has disjoint vertex sets and satisfying
and is complete or anti-complete to . This stronger property implies the pivot-minor Erdős–Hajnal conjecture, but the supplied text does not give a general resolution.
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.