Mathematical Sciences: Asymptotic Aspects of Matching, Covering, and Coloring Problems

该奖项支持卡恩教授从事组合学和图论的研究。卡恩教授将专注于与图和超图有关的问题，在这些问题中，一些参数正趋于无穷大。在这种情况下，常见的情况是，在许多方面，此类对象的行为出乎意料地良好。这项研究属于组合学的一般领域。组合学试图找到有效的方法来研究如何组织离散的集合。离散系统的行为对于现代通信来说是极其重要的。例如，大型网络的设计，如电话系统，以及计算机科学中的算法设计，都涉及离散对象，这利用了组合研究。

This award supports the research of Professor Kahn to work in combinatorics and graph theory. Professor Kahn will focus in on problems concerned with graphs and hypergraphs, where some parameter is tending towards infinity. In this situation a common occurrence is that in many ways such objects are unexpectedly well-behaved. The research is in the general area of combinatorics. Combinatorics attempts to find efficient methods to study how discrete collections can be organized. The behavior of discrete systems is extremely important to modern communications. For example, the design of large networks, as in telephone systems, and the design of algorithms in computer science all deal with discrete objects, and this makes use of combinatorial research.