ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Is the upper bound of Theorem 17 on the concentration of the chro- matic number χpGn,p q of the random graph Gn,p close to best possible or not? Conjecture 16. For all k ě 6, k even, such that the dimension of the solution space of a1 x1 . . . ak xk “ 0, b1 x1 . . . bk xk “ 0 is k ´ 2, and q sufficiently large, we have that the pair of equations is uncommon.

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.