ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a digraph DD, define the balanced degree of a vertex xx by

σ(x)=d+(x)−d−(x).\sigma(x)=d^+(x)-d^-(x).

A digraph is strongly locally irregular if σ(x)≠σ(y)\sigma(x)\neq\sigma(y) for every arc xyxy, and let slir(D)\mathrm{slir}(D) be the minimum number of colors in an arc coloring whose color classes induce strongly locally irregular digraphs. Strong local irregularity conjecture. Every digraph DD satisfies

slir(D)≤2.\mathrm{slir}(D)\leq 2.

The source notes that strong local irregularity is not directly controlled by the corresponding notion for orientations of simple graphs and presents the statement as an open conjecture supported by the paper’s investigation.

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.