|
|||||
|
|
Edge-colored complete graphs with alternating cycles |
|
| Authors: | S.H. Whitesides |
| Affiliation: | Department of Mathematics, Dartmouth College, Hanover, NH 03755, USA |
| Abstract: | We prove that if the edges of the complete graph on n≥6 vertices are colored so that no vertex is on more than Δ edges of the same color, 1<Δ<n?2, then the graph has cycles of all lengths 3 through n with no Δ consecutive edges the same color. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |