ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a subcubic graph, meaning that its maximum degree is at most 33. The subcubic injective edge-coloring conjecture.

χinj′(G)≤6.\chi'_{\rm inj}(G)\leq 6.

The injective chromatic index is the minimum number of colors in an injective edge coloring, and the conjecture would improve the general bounds known for graphs of maximum degree three. It is attributed in the source to Ferdjallah, Kerdjoudj, and Raspaud.

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.