Leading-coefficient conjecture for the q-chromatic polynomial of trees
Statement
Let be a finite tree, and let denote the -chromatic polynomial of with respect to the all-ones weight vector . Leading-coefficient conjecture. The leading coefficient of distinguishes trees. The authors state that they checked this conjecture for all trees with at most vertices, but no general resolution is given here.
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.