The Combinatorics of Large Sparse Graphs

An NSF-CBMS Regional Conference
June 7-11, 2004

Department of Mathematics
California State University at San Marcos

A randomly generated power law graph Fan Chung Graham A random subgraph of the Collaboration graph

Series of ten lectures by Fan Chung Graham (UC San Diego).

Large sparse graphs refer to graphs that can be used to model very large scale distributed networks that arise in internet computing and biological applications. Analyzing these graphs and understanding their properties is an exciting new area of research that combines techniques from probabilistic combinatorics and classical graph theory. In this CBMS Lecture Series to be held at CSUSM, Professor Fan Chung Graham, who is a leading authority in this area, will give 10 lectures that establish the main results in the field and chart possible future directions for research. Support for interested participants is available, with first priority given to graduate students, postdocs and junior faculty. All interested students and faculty are encouraged to follow the links below and apply.

The talks will be held in Room 100, University Hall (across from the main entrance of the library). There will be coffee and snacks starting at 9:00 a.m.; the talks start at 9:30 a.m.
Organized by Radhika Ramamurthi and André Kündgen. Please contact us directly if you have any questions!


"This material is based upon work supported by the National Science Foundation under Grant No. 0332519."
Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation (NSF).