NSF/CBMS Regional Research Conference in Mathematical Sciences on The Combinatorics of Large Sparse Graphs; June 7 - June 12, 2004; CSUSM

近年来，一个重要的研究领域是可以用大型复杂网络表示的现象。这些网络在许多环境中自然出现，例如，互联网、电话网络、大脑神经元的连接、国家的电网结构、熟人的社交网络和各种其他情况。组合学的工具已被广泛地用于研究这些网络的性质，以期发现和分析它们的隐藏结构。一个名为“大型稀疏图的组合学”的NSF-CBMS区域研究会议将于2004年6月7日至12日在加州州立大学圣马科斯与范忠格雷厄姆教授举行，这一领域的权威人士担任主要发言人。 会议的目的是提出大型稀疏网络研究的统一理论。我们预计，该领域的许多应用和丰富的问题将吸引专家和初学者，特别是研究生，在离散数学和理论计算机科学的所有领域。

In recent years an important area of research has been that of phenomena that can be represented by large complex networks. These networks arise naturally in many settings, for example, the Internet, the network of telephone calls made, the connection of neurons in the brain, the power grid structure in a country, social networks of acquaintances and various other situations. Tools from the area of Combinatorics have been used extensively to study the properties of these networks with the view of discovering and analyzing their hidden structures.An NSF-CBMS Regional Research Conference titled "The Combinatorics of Large Sparse Graphs" is proposed to be held at California State University San Marcos from June 7 to June 12, 2004 with Professor Fan Chung Graham, a leading authority in this area as the principal speaker. The aim of the conference is to present a unified theory of the research on large sparse networks. We expect that the many applications of the area and the richness of the problems will attract both experts and beginners, especially graduate students, in all areas of discrete mathematics and theoretical computer science.