ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d≥2d\geq 2. A graph has VC-dimension at most dd when its VC-dimension is bounded by dd. Bounded-VC-dimension Erdős–Hajnal conjecture. There exists a constant ε(d)\varepsilon(d) such that every graph on nn vertices with VC-dimension at most dd contains a clique or an independent set of size nε(d)n^{\varepsilon(d)}.

This is a bounded-VC-dimension analogue of the Erdős–Hajnal conjecture. The paper records weaker lower bounds, including e(log⁡n)1−o(1)e^{(\log n)^{1-o(1)}}, and states that the polynomial bound remains open.

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.