Two-color conjecture for strong local irregularity of digraphs
Statement
For a digraph , define the balanced degree of a vertex by
A digraph is strongly locally irregular if for every arc , and let be the minimum number of colors in an arc coloring whose color classes induce strongly locally irregular digraphs. Strong local irregularity conjecture. Every digraph satisfies
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.