Sárközy, Gábor (2017) Monochromatic cycle power partitions. DISCRETE MATHEMATICS, 340 (2). pp. 72-80. ISSN 0012-365X
|
Text
kpower_partition_u.pdf Download (106kB) | Preview |
Official URL: https://doi.org/10.1016/j.disc.2016.08.009
Abstract
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 200k2logk vertex disjoint monochromatic kth powers of cycles. © 2016 Elsevier B.V.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | powers of cycles; Monochromatic partitions |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 12 Feb 2018 07:58 |
| Last Modified: | 12 Feb 2018 07:58 |
| URI: | http://real.mtak.hu/id/eprint/74288 |
Actions (login required)
 |
Edit Item |
