For a fixed integer m, we consider edge colorings of complete graphs which contain no properly edge colored cycle Cm as a subgraph. Within colorings free of these subgraphs, we establish global structure by bounding the number of colors that can induce a spanning and connected subgraph. In the case of smaller cycles, namely C4, C5, and C6, we show that our bounds are sharp.
- Proper coloring,
- Forbidden subgraph,
- Monochromatic subgraph
Available at: http://works.bepress.com/colton_magnant/29