arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2207.01699math.CO
收藏

边染色完全图中在颜色转换受限条件下的长度为3和4的圈

Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions

Hortensia Galeana-Sánchez, Felipe Hernández-Lorenzana, Rocío Sánchez-López

AI总结:

本文研究$H$-染色完全图中$H$-圈的存在性,给出保证每个顶点均含于长度3和4的$H$-圈的条件,并推广了正常染色游走的经典定理。

摘要:

设$G$为一个边染色图,$G$中的一条游走被称为正常染色游走,当且仅当每对连续的边具有不同的颜色,包括在游走闭合的情况下首尾两条边也需颜色不同。设$H$为一个可能带环的图。我们将称图$G$为$H$-染色图,当且仅当存在一个函数$c:E(G)\longrightarrow V(H)$。$G$中的一条路径$(v_1,\cdots,v_k)$是$H$-路径,当且仅当$(c(v_1v_2),\cdots,$ $c(v_{k-1}v_k))$是$H$中的一条游走;特别地,一个圈$(v_1,\cdots,v_k,v_1)$是$H$-圈,当且仅当$(c(v_1 v_2),\cdots,c(v_{k-1}v_k),$ $c(v_kv_1), c(v_1 v_2))$是$H$中的一条游走。因此,$H$决定了游走中允许的颜色转换,以使其成为$H$-游走。当$H$是一个无环完全图时,$H$-游走就是正常染色游走,所以$H$-游走是一个更一般的概念。在本文中,我们研究$H$-染色完全图,其限制由辅助图给出。主要定理给出了条件,保证$H$-染色完全图中的每个顶点都包含在一个长度为3的$H$-圈和一个长度为4的$H$-圈中。作为主要结果的一个推论,我们得到了正常染色游走理论中的一些著名定理。

英文摘要:

Let $G$ be an edge-colored graph, a walk in $G$ is said to be a properly colored walk iff each pair of consecutive edges have different colors, including the first and the last edges in case that the walk be closed. Let $H$ be a graph possible with loops. We will say that a graph $G$ is an $H$-colored graph iff there exists a function $c:E(G)\longrightarrow V(H)$. A path $(v_1,\cdots,v_k)$ in $G$ is an $H$-path whenever $(c(v_1v_2),\cdots,$ $c(v_{k-1}v_k))$ is a walk in $H$, in particular, a cycle $(v_1,\cdots,v_k,v_1)$ is an $H$-cycle iff $(c(v_1 v_2),\cdots,c(v_{k-1}v_k),$ $c(v_kv_1), c(v_1 v_2))$ is a walk in $H$. Hence, $H$ decide which color transitions are allowed in a walk, in order to be an $H$-walk. Whenever $H$ is a complete graph without loops, an $H$-walk is a properly colored walk, so $H$-walk is a more general concept. In this paper, we work with $H$-colored complete graphs, with restrictions given by an auxiliary graph. The main theorems give conditions implying that every vertex in an $H$-colored complete graph, is contained in an $H$-cycle of length 3 and in an $H$-cycle of length 4. As a consequence of the main results, we obtain some well-known theorems in the theory of properly colored walks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑