An Anti-Ramsey Theorem on Cycles
An Anti-Ramsey Theorem on Cycles
复制标题
DOI：
10.1007/s00373-005-0619-y
复制
发表时间：
2005-09
影响因子：
0.7
通讯作者：
Juan José Montellano-Ballesteros;V. Neumann-Lara
中科院分区：
文献类型：
--
作者：
Juan José Montellano-Ballesteros;V. Neumann-Lara
设H(n，p)是最小整数，使得n阶完全图的每条边的染色，恰好使用h(n，p)色，产生至少一个有不同颜色的边的有序圈。本文确定了≥p≥3的h(n，p)的值。作为推论，我们得到了30年前由ErdöS、Simonovits和S等人猜想的等式。
Leth(n,p) be the minimum integer such that every edge-colouring of the complete graph of ordern, using exactlyh(n,p) colours, produces at least one cycle of orderphaving all its edges of different colours. In this paper the value ofh(n,p) is determinated forn≥p≥3. As a corollary we obtain the equality which was conjectured by Erdös, Simonovits and Sós, 30 years ago [4].