Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs

Let s(n, t) be the maximum number of colors in an edge-coloring of the complete graph Kn that has no rainbow spanning subgraph with diameter at most t. We prove s(n, t) = n−2 2 +1 for n, t ≥ 3, while s(n, 2) = n−2 2 + n−1 2 for n = 4 (and s(4, 2) = 2).

• Type: Journal
• Year: 2016
• Where: GC
• Authors: Sogol Jahanbekam, Douglas B. West
• Keywords: Applied Computing, GC 2016