ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph GG is kk-choosable if, for every assignment LL of a finite list of exactly kk natural-number colours to each vertex, there exists a proper colouring CC of GG such that C(v)∈L(v)C(v)\in L(v) for every vertex vv. Define the list chromatic number χL(G)\chi_L(G) to be the least such kk. Does there exist a real constant c>0c>0 such that, for every n∈Nn\in\mathbb N with n>0n>0 and every graph GG on nn vertices, n1/2+c<χL(G)+χL(Gc),n^{1/2+c}<\chi_L(G)+\chi_L(G^c), where GcG^c is the complement of GG?

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.