IPAM Institute for Pure and Applied Mathematics UCLA NSF
Skip Navigation Links
Main Page
Program Poster PDF
Lodging & Air Travel
Schedule and Presentations

Combinatorics: Methods and Applications in Mathematics and Computer Science

Workshop III: Topics in Graphs and Hypergraphs

November 2 - 6, 2009

Organizing Committee | Scientific Overview | Speaker List

Application/Registration | Contact Us

Organizing Committee

Penny Haxell (University of Waterloo, Mathematics)
Dhruv Mubayi (University of Illinois at Chicago)
Vera Sos (Renyi Institute of Mathematics)
Benjamin Sudakov (University of California, Los Angeles (UCLA), Mathematics)
Jacques Verstraete (University of California, San Diego (UCSD))

Back to Top

Scientific Overview

Graph theory is one of the oldest branches of combinatorics, with history going back to the 18 century. This area and the closely related Theory of Hypergraphs experienced the most impressive growth in the last 50 years. During this time Extremal graph theory and Extremal set theory were developed extensively and extremal results found many applications in Computer Science, Information Theory, Number Theory and Geometry. One such result is Szemeredi's regularity lemma, providing a deep structural theorem for large and dense graphs. In addition to numerous applications in combinatorics, this lemma and its recent generalization to hypergraphs, can be used, for example, to prove existence of arithmetic progressions in dense subsets of integers or to obtain algorithms for testing properties of graph. Closely related to the regularity lemma are the recent interesting research on graph limits, bridging between combinatorics and analysis. Other exciting lines of research include the development of the Structural Graph theory, and in particular the celebrated Graph Minor project.

The workshop will focus specifically on several major research directions in modern Graph and Hypergraph theory. These topics will include Ramsey theory, Extremal problems for graphs and hypergraphs and in particular Turan-type questions, Extremal set theory and its applications to Information theory, Computer science and Coding Theory, algebraic methods in extremal combinatorics, Szemeredi's regularity Lemma for graphs and hypergraphs and its application to number theory and property testing, Graph sequences and limits of graphs, topological methods for graphs and hypergraphs, Spectral techniques in graph theory, expanders graphs and their applications, structural approach to graph theory, graph minors and application of graph theory to optimization.

This workshop will include a poster session; a request for posters will be sent to registered participants in advance of the workshop.

Back to Top

Confirmed Speakers

Maria Chudnovsky (Columbia University)
David Conlon (University of Cambridge)
Zoltan Furedi (University of Illinois at Urbana-Champaign)
Penny Haxell (University of Waterloo)
Peter Keevash (Queen Mary, University of London)
Alexander Kostochka (University of Illinois at Urbana-Champaign)
Imre Leader (University of Cambridge)
Po-Shen Loh (Princeton University)
Tomasz Luczak (Adam Mickiewicz University)
Bojan Mohar (Simon Fraser University)
Dhruv Mubayi (University of Illinois at Chicago)
Jarik Nesetril (Charles University, Prague)
Oleg Pikhurko (Carnegie-Mellon University)
Paul Seymour (Princeton University)
Asaf Shapira (Georgia Institute of Technology)
Miklos Simonovits (Renyi Institute of Mathematics)
Vera Sos (Renyi Institute of Mathematics)
Tibor Szabo (Freie Universität Berlin)
Endre Szemeredi (Rutgers University)
Gabor Tardos (Simon Fraser University)
Stephan Thomasse (Université des Sciences et Techniques de Languedoc (USTL) (Montpellier II))
Jacques Verstraete (University of California, San Diego (UCSD))

Back to Top

Contact Us:

Institute for Pure and Applied Mathematics (IPAM)
Attn: CMAWS3
460 Portola Plaza
Los Angeles CA 90095-7121
Phone: 310 825-4755
Fax: 310 825-4756
Email: ipam@ucla.edu
Website: http://www.ipam.ucla.edu/programs/cmaws3/

Back to Top

NSF Math Institutes   |   Webmaster