Skip to main content

Emily Zhu

Mathematics

Emily is interested broadly in areas of Combinatorics, particularly Extremal Combinatorics, which is the study of how small or large various substructures can be under certain constraints. For instance, one structure which is frequently studied is a graph, which consists of a collection of points and a collection of edges containing pairs of points. When considering a complete graph, which is a collection of points and all possible edges between these points, and coloring the edges with red and blue, one can ask how many points can we find such that all edges between these points are the same color? This is known to be on the order of log n where n is the number of points in the complete graph, although the exact growth rate is still unknown. Emily is also an executive member in the chapter of the Association for Women in Mathematics at UCSD and an NSF Graduate Research Fellow.