Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4646558 | Discrete Mathematics | 2017 | 9 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gábor N. Sárközy,