Katona, Gyula and Tuza, Zsolt (2013) Color the cycles. DISCRETE MATHEMATICS, 313. pp. 2026-2033. ISSN 0012-365X
|
Text
Color the cycles.pdf Download (261kB) | Preview |
Abstract
The cycles of length k in a complete graph on n vertices are colored in such a way that edge-disjoint cycles get distinct colors. The minimum number of colors is asymptotically determined. © 2013.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Turán type problem; CYCLE; coloring |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 11 Dec 2013 08:43 |
| Last Modified: | 11 Dec 2013 10:20 |
| URI: | http://real.mtak.hu/id/eprint/7990 |
Actions (login required)
 |
Edit Item |
