The Local Irregularity Conjecture excluding the bow-tie graph

About 2 years old · traced to

Let BB be the bow-tie graph, and let GG be a connected graph that is locally irregularly colorable. Write lir⁡(G)\operatorname{lir}(G) for its locally irregular chromatic index.

Local Irregularity Conjecture. If G≠BG\neq B, then

lir⁡(G)≤3.\operatorname{lir}(G)\leq 3.

This is the improved form of the original conjecture after the bow-tie graph was found to require four colors. The source reports this as a conjecture established by Sedlar and Škrekovski, with the bound proved for cacti other than BB.

References

Primary source

Igor Grzelec, Tomáš Madaras, Alfréd Onderko and Roman Soták, “On a new problem about the local irregularity of graphs”, arXiv:2405.13893 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.