Sciweavers

Share
GC
2016
Springer

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

3 years 18 days ago
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).
Sogol Jahanbekam, Douglas B. West
Added 03 Apr 2016
Updated 03 Apr 2016
Type Journal
Year 2016
Where GC
Authors Sogol Jahanbekam, Douglas B. West
Comments (0)
books