Combinatorics: Topics in Graphs and Hypergraphs

Month: November 2009

Date: November 2--6

Name: Combinatorics: Topics in Graphs and Hypergraphs

Location: Institute for Pure and Applied Mathematics (IPAM), UCLA, Los Angeles, California.

Overview

The workshop will focus on several research directions in modern graph and hypergraph theory including 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.

Organizing Committee

Penny Haxell, Dhruv Mubayi, Vera Sos, Benjamin Sudakov, Jacques Verstraete.

Application/Registration

An application and registration form is available at: http://www.ipam.ucla.edu/programs/cmaws3/. Applications received by Sept. 21, 2009, will receive fullest consideration. Encouraging the careers of women and minority mathematicians and scientists is an important component of IPAM's mission and we welcome their applications. You may also register and attend without IPAM funding.

Information

http://www.ipam.ucla.edu/programs/cmaws3/;
e-mail: sbeggs@ipam.ucla.edu.