Twenty-Fourth Cumberland Conference on Combinatorics, Graph Theory, and Computing

第24届坎伯兰组合学、图论和计算会议将于2011年5月12日至14日在肯塔基州路易斯维尔大学谢尔比校区举行。这是一个年度会议，自1988年以来每年都在不同的地点举行；它聚集了来自美国东南部地区的学生和研究人员，讨论离散数学和计算机科学的最新进展。会议的主题是“在新旧之间架起桥梁”，这一主题反映了我们对支持下一代离散数学家和计算机科学家的承诺。本次会议作为各层次研究人员的区域性交流，具有独特的作用，但特别鼓励年轻的教职员工和学生参与。会议的主题是偏序集、超图、极值组合学及其应用，特别是在理论计算机科学和计算复杂性方面。这些主题的应用涵盖了广泛的自然科学和社会科学，并构成了现代信息基础设施的理论基础。组合和图论方法被用于生物、计算机科学、生态学、统计物理、化学和物流问题，包括与移动电话网络和互联网等交通和通信网络有关的问题。计算复杂性理论是计算机科学的一个分支，它试图根据解决问题所需的资源对问题进行分类。在许多情况下，组合工具被用来确定资源的最佳使用。会议预计将吸引大约100名参与者和数十场贡献的演讲。四位国际知名研究人员已接受邀请担任主要演讲人：玛丽亚·阿克森诺维奇(爱荷华州立大学)、杰诺·莱赫(孟菲斯大学)、德鲁夫·穆巴伊(伊利诺伊大学芝加哥分校)和威廉·T·特罗特(佐治亚理工学院)。这次会议是由路易斯维尔大学数学系的一个七人委员会组织的，委员会主席是安德烈·凯兹迪。欲了解更多信息，请访问会议网站：http://www.math.louisville.edu/Cumberland/。

The Twenty-Fourth Cumberland Conference on Combinatorics, Graph Theory and Computing will be held May 12-14, 2011 at the Shelby campus of the University of Louisville, Louisville, Kentucky. This is an annual conference that has been held every year since 1988 at varying venues; it brings together students and researchers from across the South Eastern U.S. region to discuss the latest advances in discrete mathematics and computer science. The conference theme is ``building bridges between the old and the new'', a theme that reflects our commitment to the support of the next generation of discrete mathematicians and computer scientists. This conference plays a unique role as a regional exchange for researchers of all levels, but young faculty and students are especially encouraged to participate. The conference topics are partially ordered sets, hypergraphs, extremal combinatorics, and applications of these, particularly to theoretical computer science and computational complexity. Applications of these topics span a broad spectrum of natural and social sciences, and form the theoretical foundation of modern information infrastructure. Combinatorial and graph-theoretic methods are used in problems of biology, computer science, ecology, statistical physics, chemistry, and logistics, including problems concerning transportation and communication networks such as cellular phone networks and the Internet. Computational complexity theory is a branch of computer science that seeks to categorize problems according to the resources required to solve them. In many cases, combinatorial tools are used to determine the optimal use of resources.The conference is expected to attract roughly 100 participants and scores of contributed talks. Four internationally-renowned researchers have accepted invitations to be principal speakers: Maria Axenovich (Iowa State University), Jeno Lehel (University of Memphis), Dhruv Mubayi (University of Illinois at Chicago), and William T. Trotter (The Georgia Institute of Technology). The conference is organized by a committee of seven people from the Department of Mathematics at the University of Louisville; the chair of the committee is André Kézdy. More information can be found at the conference web site: http://www.math.louisville.edu/Cumberland/