Dybizbański–Furmańczyk–Mkrtchyan gap-one conjecture
Statement
For every finite block graph , define , where is the clique number and . The conjecture asserts that , where is the least number of colors in a proper coloring of whose color-class sizes differ by at most .
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.