What is the maximum number of edges in a graph on n vertices without triangles? Mantel’s answer in 1907—that at most half of the edges can be present—started a new field: extremal combinatorics. More generally, what is the maximum number of edges in an n-vertex graph that does not contain any subgraph isomorphic to H? What about if you consider hypergraphs instead of graphs? I will introduce the technique of sums of squares and discuss how it can be used to attack such problems.
The Amherst College Queer and Trans People of Color Affinity Space centers students from Amherst College and within the Five Colleges who identify as queer/trans/genderqueer people of color. Presented by the QRC and MRC.
Staff and faculty who identify with the QTPOC community are welcome to attend!
Dinner will be served on: 09/25*, 10/23*, 11/20* (in the QRC)
Just discussion will be hosted on: 10/09, 11/06, 12/04 (in the MRC)