Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2301.07181

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
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 to digraphs (using the dichromatic number) by J. Bang-Jensen et. al. and Hajós (directed) operations is a tool to obtain r-(di)chromatic (di)graphs. J. Bang-Jensen et. al. posed in 2020 the problem of how to obtain the symmetric cycle of length 5 from symmetric cycles of length 3. We recently solved this problem by applying a genetic algorithm. In this article, a procedure is presented to construct any odd symmetric cycle by applying directed Hajós operations to symmetric cycles of length 3, thus, generalizing the known construction of the symmetric cycle of length 5. In addition, this procedure is analyzed to determine its computational complexity.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Juan Carlos García-Altamirano, Mika Olsen, Jorge Cervantes-Ojeda. 2023-01-17. A procedure to obtain symmetric cycles of any odd length using directed Hajós constructions. https://arxiv.org/abs/2301.07181

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗