Speaker
Description
A circular $r$-edge-coloring of a graph is an assignment of colors from $\mathbb{R}/r\mathbb{Z}$ to its edges such that the colors assigned to any two adjacent edges differ by at least one. The circular chromatic index of a graph $G$, denoted by $\chi'_c(G)$, is the infimum of all values $r$ for which $G$ admits a circular $r$-edge-coloring. The circular chromatic index is a refinement of the chromatic index, satisfying $\lceil \chi'_c(G)\rceil = \chi'(G)$. It is also easy to see that $\chi'_c(G)\geq \Delta(G)$, where $\Delta(G)$ denotes the maximum degree of $G$.
We show that every rational number $q\in[3,3+\frac25]$ occurs as the circular chromatic index of some graph. Moreover, we prove that the Petersen graph is the only graph whose circular chromatic index belongs to the interval $(3+\frac12,4)$; its circular chromatic index is $3+\frac23$. Several classes of graphs with circular chromatic index equal to $3+\frac12$ are already known. We present several further classes of graphs whose circular chromatic indices lie in the interval $(3+\frac25,3+\frac12)$.