Cycles Avoiding a Color in Colorful Graphs
| Autor: | Dirk Meierling, Janina Müttel, Dieter Rautenbach |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Discrete mathematics
010102 general mathematics Complete graph 0102 computer and information sciences 01 natural sciences Combinatorics 010201 computation theory & mathematics Discrete Mathematics and Combinatorics Geometry and Topology Ramsey's theorem Monochromatic color 0101 mathematics Pancyclic graph Mathematics |
| Zdroj: | Journal of Graph Theory. 81:342-350 |
| ISSN: | 0364-9024 |
| DOI: | 10.1002/jgt.21879 |
| Popis: | The Ramsey numbers of cycles imply that every 2-edge-colored complete graph on n vertices contains monochromatic cycles of all lengths between 4 and at least . We generalize this result to colors by showing that every k-edge-colored complete graph on vertices contains -edge-colored cycles of all lengths between 3 and at least . |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text