Xu–Liu conjecture on degree sequences of chromatically equivalent complements
Statement
Let be a simple graph, let denote its chromatic polynomial, and let denote its complement. Suppose that
Xu–Liu conjecture. Then and 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.