Chromatic number of $\frac{3}{3}$-power of graph

Medium ★★ Graph Theory

Status partial high confidence

The conjecture $\chi(G^{3/3}) \leq 2\Delta(G)+1$ remains open in general. Anastos, Boyadzhiyska, Rathke, and Rué (2024) proved the asymptotically tight bound $\chi(G^{3/3}) \leq \Delta + C\log\Delta$ for all graphs $G$ (with $C=28$ for sufficiently large $\Delta$), which confirms the conjecture for all sufficiently large $\Delta$ and is in fact stronger than $2\Delta+1$ in that regime, but leaves the exact conjecture open for small-to-moderate values of $\Delta \geq 5$ not already handled by pre-posting results. Lower bounds show $\chi(G^{3/3}) \geq \Delta + \Omega(\log\Delta)$ for infinitely many $\Delta$, making the new upper bound essentially tight.

Cited literature (1)

Reviewer notes. The DOI 10.1016/j.dam.2024.10.002 (Discrete Applied Mathematics, Vol. 360, pp. 506–511) was found in web search results and is consistent with the ISTA research-explorer metadata, but ScienceDirect returned HTTP 403 so the journal page could not be independently verified via WebFetch; the arXiv preprint is fully verified. A 2024 paper by Mozafari-Nia and Iradmusa on simultaneous coloring of hypercubes (Communications in Combinatorics and Optimization, Vol. 9(1), pp. 67–77) was mentioned in search results but the publisher's website was unreachable (ECONNREFUSED), so it was not cited. The Opuscula Mathematica paper on incidence coloring of graph fractional powers (vol. 43, no. 1) was also found but its PDF was binary-encoded and could not be read; it appears to predate the posting date in any case.

Auto-reviewed 2026-05-08 with claude-sonnet-4-6 (web search enabled) · 235s.

Conjecture. Let $ G $ be a graph with $ \Delta(G)\geq 2 $ . Then $ \chi(G^{\frac{3}{3}})\leq 2\Delta(G)+1 $ .

Bibliography

  • [1] Mahsa Mozafari-Nia and M. N. Iradmusa, Simultaneous coloring of vertices and incidences of graphs, Australasian Journal of Combinatorics, Vol. 85, Mo. 3, pp. 287-307, 2023.
  • [2] Mahsa Mozafari-Nia and M. N. Iradmusa, Simultaneous coloring of vertices and incidences of outerplanar graphs, Electronic Journal of Graph Theory and Applications, Vol.11, No.1, pp.245-262, 2023.
  • [3] Mahsa Mozafari-Nia and M. N. Iradmusa, A note on coloring of 3/3-power of subquartic graphs, Australasian Journal of Combinatorics, Vol. 79, No. 3, pp. 454-460, 2021.
  • [4] M. N. Iradmusa, A short proof of 7-colorability of 3/3-power of subcubic graphs, Iranian Journal of Science and Technology, Transactions A: Science, Vol. 44, No. 1, pp. 225-226, 2020.