ProbXiv
Explorersign in
Problem archiveProblem record

Statement

conjecture. Conjecture 1 (Multicoloured geometric Erdős-Hajnal conjecture). For every prime power q, all k, s \in N and every s-colouring c0 of PG(k − 1, q), there exists \delta, C > 0 such that, for all n \in N and every c0 -free colouring c of G \sim = PG(n − 1, q), there is a subspace of G with dimension at least Cn\delta that uses at most s−1 colours. In other words, an s-colouring omitting all copies of any fixed small s-colouring must be very ‘far from random’ in the sense of containing a large subspace in which some colour fails to appear. Our main results resolve the conjecture in all the cases where (k, q) = (2, 2), and certain cases with (k, q, s) = (2, 3), and (k, q, s) = (3, 2, 2). If (k, q) = (2, 2), then c0 is a colouring of a three-element ‘triangle’, and there are three essentially different cases, all of which we resolve. We derive both the cases where c0 assigns the same colour to two different elements from a recent Rainbow triangles and the Erdős-Hajnal problem in projective geometries Peter Nelson (joint work with Carolyn Chun, James Dylan Douthitt, Wayne Ge, Tony Huynh, Matthew E. Kroeker)

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.