Math Talk: "Turan's Problem," Annie Raymond
Thursday, October 15, 4:10 PM - 5:00 PM
Physics 123
This event is open to the public.
LECTURE
Annie Raymond, Department of Mathematics, University of Washington
Mathematics Talk: Turan's Problem
Thursday, October 15, 2015, 4:10 p.m., Physics 123
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 a n-vertex graph that does not contain any subgraph isomorphic to H? What about if you consider hypergraphs instead of graphs? We will explore different strategies to attack such problems, calling upon combinatorics, integer programming, semidefinite programming and flag algebras. We will conclude with some recent work where we embed the flag algebra techniques in more standard methods.
This is joint work with Mohit Singh and Rekha Thomas.
All are welcome. Free and open to the public. Refreshment will be provided.
3203 SE WOODSTOCK BLVD | PORTLAND, OREGON 97202
For more information, visit:
http://academic.reed.edu/math/seminars/index.html.
Submitted by Kim Kadas.
Posted on Oct 6, 2015