Rainbow Connections in Multipartite Graphs

Faculty Member

Sean English

Project Image

Given a graph G, an edge coloring of G is called rainbow if every edge of G is colored differently. We will say two vertices of G are rainbow connected if there is a rainbow path that connects the two vertices. This project will be concerned with coloring large graphs with few colors such that every pair of vertices are rainbow connected, even if the entire coloring is not rainbow.

Team Meetings

Weekly

Project Difficulty

Intermediate

Undergrad Prerequisites

Graph Theory, preferably combinatorics, is helpful, but not required.