Graph theory

Tuesday, June 16, 2009 - 2:00pm - 3:30pm
Volkan Isler (University of Minnesota, Twin Cities)
No Abstract
Friday, November 30, 2012 - 2:00pm - 3:00pm
Jacob Fox (Massachusetts Institute of Technology)
Szemerédi's regularity lemma is one of the most powerful tools
in graph theory, with many applications in combinatorics, number theory,
discrete geometry, and theoretical computer science. Roughly speaking, it
says that every large graph can be partitioned into a small number of parts
such that the bipartite subgraph between almost all pairs of parts is
random-like. Several variants of the regularity lemma have since been
established yielding many further applications. In this talk, I will survey
Friday, November 30, 2012 - 10:30am - 11:30am
Noga Alon (Tel Aviv University)
Tools from Extremal Graph Theory are helpful in the study of problems
in Additive Number Theory, Theoretical Computer Science, and Information
Theory. I will illustrate this fact by several closely related examples
focusing on a recent one in a joint work with Moitra and Sudakov.

The main combinatorial question addressed, whose study was initiated by
Ruzsa and Szemeredi, is that of estimating the maximum possible density of
a graph consisting of a union of pairwise edge disjoint large induced
Friday, November 30, 2012 - 9:00am - 10:00am
Vera Sos (Hungarian Academy of Sciences (MTA))
The Szemeredi regularity lemma is crucial in graph limit theory.It is
a basic tool to study large dense graphs: e.g. how to consider similarity,
approximation by small graphs, how local and global properties are related to each other. It provides important new bridge between graph theory
and other fields like analysis, probability, topology.Focusing on these
aspects, I will give a reiew on some parts of limit theory -
which developed in the last few years in the center with Laszlo Lovasz.
Wednesday, August 3, 2011 - 11:20am - 11:40am
Subscribe to RSS - Graph theory