ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let k∈Z+k\in\mathbb{Z}^+, and let DD be a kk-optimal set, meaning a kk-dependent set maximizing ϕk(D)=k∣D∣−∣E(G[D])∣\phi_k(D)=k|D|-|E(G[D])|. A subgraph is kk-edge-chromatic if its edges can be coloured with kk colours so that adjacent edges receive different colours. The kk-optimal set edge-colouring conjecture. If DD is a kk-optimal set in GG, then GG has a kk-edge-chromatic subgraph in which every vertex of V(G)−DV(G)-D has degree kk.

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 Ik∨HI_k\vee H. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.