Annie Raymond

This workshop aims to build a community of mathematicians who self-identify as gender minorities in mathematics and who work in optimization at the intersection of combinatorics, algebra, and geometry. To achieve this goal, the workshop focuses both...

Invited Minisymposia: IM1: Descriptive combinatorics ( Anton Bernshteyn, UCLA and Felix Weilacher, UC Berkeley) IM2: Pursuit-evasion games on graphs ( Anthony Bonato, Toronto Metropolitan University) IM3: How Many? The Art and Craft of Counting (...

Establishing inequalities among graph densities is a central pursuit in extremal graph theory. One way to certify the nonnegativity of a graph density expression is to write it as a sum of squares or as a rational sum of squares. In this talk, we...

The number of homomorphisms from a graph H to a graph G, denoted by hom(H;G), is the number of maps from V(H) to V(G) that yield a graph homomorphism, i.e., that map every edge of H to an edge of G. Given a fixed collection of finite simple graphs {H...

Graphs are ubiquitous in modern applications---including some very large graphs. This leads one to wonder, "How can we understand such large graphs?" One prevalent idea is to observe them locally: to count how many times certain substructures appear...