Chromatic-polynomial/list-color-function persistence conjecture
Statement
For every finite graph and every integer , if , then , where is the number of proper -colorings of and is the minimum, over all assignments of lists of colors to the vertices of , of the number of proper -colorings.
Record
- Added
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.