Name
Abstract | ||
|---|---|---|
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 . |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1002/jgt.21879 | Journal of Graph Theory |
Keywords | Field | DocType |
ramsey numbers | Discrete mathematics,Complete graph,Graph,Combinatorics,Monochromatic color,Vertex (geometry),Ramsey's theorem,Mathematics,Pancyclic graph | Journal |
Volume | Issue | ISSN |
81 | 4 | 0364-9024 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dirk Meierling | 1 | 56 | 11.55 |
| Janina Müttel | 2 | 6 | 2.87 |
| Dieter Rautenbach | 3 | 946 | 138.87 |