Edge-criticality conjecture for the quadrangulation graph QG(n,k)
Statement
For integers and , let be the spanning subgraph of the Schrijver graph constructed in Theorem 1.1, which is a quadrangulation of and satisfies . A graph is edge-critical if deleting any edge decreases its chromatic number. Edge-criticality conjecture. For any and , is edge-critical. The graph has the same chromatic number as , and this conjecture proposes the edge-critical analogue of Schrijver's vertex-criticality result; it remains open in the source.
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.