ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a subcubic graph, meaning a graph with maximum degree at most 33. The injective chromatic index, denoted by χinj⁡′(G)\chi'_{\operatorname{inj}}(G), is the minimum number of colors in an injective edge-coloring of GG. Subcubic injective edge-coloring conjecture. For every subcubic graph,

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

The preceding theorem gives the weaker upper bound 88, while the complete graph supplies a lower-bound example; the proposed improvement is left unresolved in the supplied 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.