A procedure to obtain symmetric cycles of any odd length using directed Hajós constructions

Juan Carlos García-Altamirano, Mika Olsen, Jorge Cervantes-Ojeda

The dichromatic number of a digraph $D$ is the minimum number of colors of a vertex coloring of $D$ such that $D$ has no monochromatic cycles. The Hajós join were recently extended…