ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a Hasse diagram on nn vertices, and let χ(G)\chi(G) denote its chromatic number. Hasse-diagram chromatic number gap conjecture. There exists ϵ>0\epsilon>0 such that

χ(G)≤n1/2−ϵ.\chi(G)\leq n^{1/2-\epsilon}.

The paper proves a lower bound of order Ω(n1/4)\Omega(n^{1/4}) for the largest possible chromatic number of a Hasse diagram, while the general upper bound for triangle-free graphs is n1/2+o(1)n^{1/2+o(1)}. Whether a power gap below n1/2n^{1/2} always holds 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.