Math Colloquium, Jonathan Cutler (Montclair): 'Enumerative extrema lproblems in graph theory'

Thursday, November 20, 2014
4:15 PM - 5:15 PM (ET)
ESC 638
Event Type
Academic Calendar
Contact
Cameron Hill
Department
Math/CS Colloquium
Link
https://eaglet.wesleyan.edu/MasterCalendar/EventDetails.aspx?EventDetailId=63443

Abstract: Extremal graph theory can be thought of as the study of problems of the following form: given a class of graphs, which graph maximizes (or minimizes) some graph invariant? In this talk, we will be interested in these problems when the graph invariant counts the number of certain substructures in a graph. For example, one may be interested in the number of independent sets (sets of vertices containing no edges) in a graph. This talk will introduce the audience to the history of these types of problems and survey some recent results and techniques in the area. We hope to present many interesting open questions as well.

Get Directions
Event Date
Event Time
Title
Building