Edwards–King edge-local conjecture for graph coloring
Statement
Let be a finite simple graph. For each vertex , let , let , and let
Edwards–King conjecture. For any graph ,
This is a stronger edge-local form of the local Reed conjecture. The source says that the result holds in the fractional setting and for quasi-line graphs, while its validity for arbitrary graphs remains unresolved.
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.