For a graph G, can one obtain efficiently computable bounds for the chromatic number \chi(G) that improve on the fractional chromatic number, and can such bounds be defined by…
Statement
For a graph G, can one obtain efficiently computable bounds for the chromatic number \chi(G) that improve on the fractional chromatic number, and can such bounds be defined by compact semidefinite programs suitable for practical computation?
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.