Monochromatic cycle power partitions
详细信息 查看全文
- 作者：Gá ; bor N. Sá ; rkö ; zy ; gsarkozy@cs.wpi.edu
- 关键词：Monochromatic partitions ; Powers of cycles
- 刊名：Discrete Mathematics
- 出版年：2017
- 出版时间：6 February 2017
- 年：2017
- 卷：340
- 期：2
- 页码：72-80
- 全文大小：427 K
- 卷排序：340
文摘
Improving our earlier result we show that for every integer k≥1k≥1 there exists a c(k)c(k) such that in every 2-colored complete graph apart from at most c(k)c(k) vertices the vertex set can be covered by 200k2logk200k2logk vertex disjoint monochromatic kkth powers of cycles.