The k-optimal set edge-colouring conjecture
Statement
Let be a graph, let , and let be a -optimal set, meaning a -dependent set maximizing . A subgraph is -edge-chromatic if its edges can be coloured with colours so that adjacent edges receive different colours. The -optimal set edge-colouring conjecture. If is a -optimal set in , then has a -edge-chromatic subgraph in which every vertex of has degree .
This conjecture is introduced as a natural strengthening of the results developed earlier and is stated to imply the special case of Tuza's conjecture for graphs of the form . Its resolution is not supplied 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.