BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//www.amherst.edu/node/754687//NONSGML kigkonsult.se iCalcreator 2.
24.2//
X-WR-TIMEZONE:UTC
BEGIN:VEVENT
UID:20200808T164746EDT-2665fe3a9c@www.amherst.edu/node/754687
DTSTAMP:20200808T204746Z
CATEGORIES:Amherst Event
DESCRIPTION:What is the maximum number of edges in a graph on <\;i>\;n&
lt\;/i>\; vertices without triangles? Mantel’s answer in 1907—that at mo
st half of the edges can be present—started a new field: extremal combinat
orics. More generally\, what is the maximum number of edges in an <\;i&g
t\;n<\;/i>\;-vertex graph that does not contain any subgraph isomorphi
c to H? What about if you consider hypergraphs instead of graphs? I will i
ntroduce the technique of sums of squares and discuss how it can be used t
o attack such problems.
DTSTART:20191106T213000Z
DTEND:20191106T213000Z
LOCATION:Seeley G. Mudd Building\, 206
SUMMARY:Math Colloquium: “Turán’s Problem and an Introduction to Sums of Sq
uares” by Annie Raymond
END:VEVENT
END:VCALENDAR