摘要
假设c是一个小于1/1152的常数.证明:对于每个充分大的偶数n,如果一个具有n个顶点的3一致完全超图的边着色满足每种颜色出现的次数不超过[cn],那么必含有一个每条边颜色都不一样的彩色哈密顿圈.
The hyperedges of the complete 3-uniform hypergraph are colored so that no color appears more than [cn] times, where c 〈 1/1152 is a constant. We show that ifn is a sufficiently large even number, then there is a hamiltonian cycle in which each edge is of a different color.
出处
《数学研究》
CSCD
2010年第2期114-121,共8页
Journal of Mathematical Study
基金
supported by NNSF of china(60373012)
NSF of Fujian Province(2009-XQ-27)
关键词
彩色的
一致超图
哈密顿圈
Multicolored
uniform hypergraphs
Hamilton cycles