Please join us for the talk by our first tenure-track candidate in Mathematics. Anastasia Halfpap will speak on Tuesday, January 21, at 3:00 PM in HNS 106. We hope to see you there.
Necmettin Yildirim and Eirini Poimenidou
Co-chairs of the search committee
Here is the title and abstract:
Title: Rainbow Turán and Saturation Numbers: Colorful Problems in Extremal Graph Theory
Abstract: A graph is a discrete mathematical structure consisting of two sets: a vertex set V of base elements, and an edge set E which describes the connections between elements. Graphs can naturally be visualized as a set of points (vertices) in the plane connected by lines (edges). Study of graphs is motivated by many applications both within and outside mathematics, as well as the deep and beautiful pure-mathematical theory describing their properties. In this talk, we will introduce the field of extremal graph theory, which asks how large (or small) some graph parameter can be given some structural restrictions upon the graph. For example, in a graph containing n vertices and with the property that no three vertices are connected to form a triangle, how many total edges are possible? As well as introducing some history of extremal problems, we will discuss some recent work in the area of rainbow extremal problems, which asks extremal-type questions in an edge-colored graph setting.