Michael Young, Iowa State University

Date: Time: 4:00 pm–4:50 pm Location: Avery Hall
Abstract: A 3-term arithmetic progression of a graph is a set of vertices, {u, v, w}, such that dist(u,v) = dist(v,w). A set is called rainbow if no two elements in the set are assigned the same color. In this talk, we will discuss the minimum number …