Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or TreesJournal of Graph Theory (2016)
We seek the maximum number of colors in an edge‐coloring of the complete graph not having t edge‐disjoint rainbow spanning subgraphs of specified types. Let , , and denote the answers when the spanning subgraphs are cycles, matchings, or trees, respectively. We prove for and for . We prove for and for . We also provide constructions for the more general problem in which colorings are restricted so that colors do not appear on more than q edges at a vertex.
Publication DateMay 1, 2016
Citation InformationSogol Jahanbekam and Douglas B. West. "Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees" Journal of Graph Theory Vol. 82 Iss. 1 (2016) p. 75 - 89 ISSN: 0364-9024
Available at: http://works.bepress.com/sogol-jahanbekam/4/