The multigraph formulation of the (2,2) Conjecture

About 4 years old · traced to

Let GG be a connected graph of order n≥4n\geq 4. Let M[2](H)\mathcal{M}^{[2]}(H) denote the family of multigraphs obtained from a graph HH by edge multiplication with edge multiplicities at most 22, and call a multigraph locally irregular when adjacent vertices have distinct degrees. (2,2) Conjecture. The graph GG can be decomposed into two subgraphs GrG_r and GbG_b such that there exist locally irregular multigraphs

G^r∈M[2](Gr),G^b∈M[2](Gb).\hat G_r\in\mathcal{M}^{[2]}(G_r),\qquad \hat G_b\in\mathcal{M}^{[2]}(G_b).

This is the multigraph formulation of the preceding (2,2)(2,2)-coloring conjecture. Its general status is open.

References

Primary source

Igor Grzelec and Mariusz Woźniak, “On decomposing multigraphs into locally irregular submultigraphs”, arXiv:2208.08809 (2022).

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.