Student: Bianca Viray
School: University of Maryland, College Park
Email: bianca@umd.edu
Research Area(s): Graph Theory
Project Name: Applications in geometry and theory of positional games
Faculty Advisor: Dr. Vladimir Gurvich, RUTCOR
Rutgers University

Project Description

All edges of a complete graph G are colored by 3 colors, that is labeled by positive integers {1,2,3}. If G contains a triangle whose 3 edges are colored by 3 pairwise distict colors then there exist three cliques C1, C2, C3 such that no edge from Ci is labeled by i and the intersection of C1, C2, and C3 are empty.

This problem has applications in geometry and theory of positional games.