ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a graph. A set of vertices AA is complete to a disjoint set BB if every vertex of AA is adjacent to every vertex of BB, and anti-complete if no such edges exist. Strong pivot-minor Erdős–Hajnal conjecture. For every graph HH, there exists ε>0\varepsilon>0 such that, for every n>1n>1, every nn-vertex graph with no pivot-minor isomorphic to HH has disjoint vertex sets AA and BB satisfying

∣A∣,∣B∣≥εn\lvert A\rvert,\lvert B\rvert\ge \varepsilon n

and AA is complete or anti-complete to BB. 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 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.