ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple graph, let pG(k)p_G(k) denote its chromatic polynomial, and let G‾\overline{G} denote its complement. Suppose that

pG(k)=pG‾(k).p_G(k)=p_{\overline{G}}(k).

Xu–Liu conjecture. Then GG and G‾\overline{G} have the same degree sequence. This conjecture concerns graphs whose chromatic polynomial agrees with that of their complement. The paper disproves it by constructing infinitely many graphs with the stated chromatic-polynomial property but different degree sequences from their complements.

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.