arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.6345math.CO
收藏

图的单色团分解

Monochromatic Clique Decompositions of Graphs

Henry Liu, Oleg Pikhurko, Teresa Sousa

摘要:

设$G$是一个边用$k$颜色着色的图,$\mathcal H=(H_1,\dots , H_k)$是图的$k$ -元组.单色$\mathcal H$ -$G$的分解是$G$的边缘集的划分,使得对于某些$1\le i\le k$,每个部分是单个边缘或形成彩色$i$中的$H_i$的单色副本。设$ϕ_{k}(n,\mathcal H)$是最小数$ϕ$,使得对于每一阶$n$图和每一$k$边着色,存在一个至多含有$ϕ$元素的单色$\mathcal H$分解.扩展Liu和Sousa [“Monochromatic $K_r$ -decompositions of graphs”,Journal of Graph Theory },76:89- 100,2014]的先前结果,当$\mathcal H$中的每个图是团并且$n\ge n_0(\mathcal H)$足够大时,我们解决了这个问题。

英文摘要:

Let $G$ be a graph whose edges are coloured with $k$ colours, and $\mathcal H=(H_1,\dots , H_k)$ be a $k$-tuple of graphs. A monochromatic $\mathcal H$-decomposition of $G$ is a partition of the edge set of $G$ such that each part is either a single edge or forms a monochromatic copy of $H_i$ in colour $i$, for some $1\le i\le k$. Let $ϕ_{k}(n,\mathcal H)$ be the smallest number $ϕ$, such that, for every order-$n$ graph and every $k$-edge-colouring, there is a monochromatic $\mathcal H$-decomposition with at most $ϕ$ elements. Extending the previous results of Liu and Sousa ["Monochromatic $K_r$-decompositions of graphs", Journal of Graph Theory}, 76:89--100, 2014], we solve this problem when each graph in $\mathcal H$ is a clique and $n\ge n_0(\mathcal H)$ is sufficiently large.

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

↑