Skip to main content
profile image
Selected Works of Sogol Jahanbekam
Presentation
Rainbow spanning subgraphs in edge-colored complete graphs
UIUC Combinatorics Seminar (2013)
  • Sogol Jahanbekam, University of Illinois at Urbana-Champaign
Abstract
For integers n and t, let r(n,t) be the maximum number of colors in an edge-coloring of the complete graph Kn that does not contain t edge-disjoint rainbow spanning trees. Let s(n,t) be the maximum number of colors in an edge-coloring of Kn containing no rainbow spanning subgraph with diameter at most t. We determine r(n,t) whenever n>2t+6t−234−−−−−−√+52 and when n=2t. We also determine s(n,t) for all pair n and t. This is joint work with D. B. West.
Disciplines
Publication Date
February 19, 2013
Location
Urbana, IL
Citation Information
Sogol Jahanbekam. "Rainbow spanning subgraphs in edge-colored complete graphs" UIUC Combinatorics Seminar (2013)
Available at: http://works.bepress.com/sogol-jahanbekam/41/