Monochromatic cycle power partitions
| Autor: | Gábor N. Sárközy |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
010102 general mathematics Complete graph 0102 computer and information sciences Disjoint sets 01 natural sciences Theoretical Computer Science Vertex (geometry) Combinatorics 010201 computation theory & mathematics Discrete Mathematics and Combinatorics Monochromatic color 0101 mathematics Mathematics |
| Zdroj: | Discrete Mathematics. 340:72-80 |
| ISSN: | 0012-365X |
| DOI: | 10.1016/j.disc.2016.08.009 |
| Popis: | Improving our earlier result we show that for every integer k ≥ 1 there exists a c ( k ) such that in every 2-colored complete graph apart from at most c ( k ) vertices the vertex set can be covered by 200 k 2 log k vertex disjoint monochromatic k th powers of cycles. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect