Mathematical Sciences: Graph Minor Structure Theory

小行星9401981 该奖项支持G教授的研究。尼尔·罗伯逊（Neil Robertson）从事组合学工作。 罗伯逊教授将继续他的工作，在图未成年人项目，试图提供更好的信息有限图。 这项工作将包括调查的着色，表面嵌入，有限结构和连通性的图形的问题。 该研究是在组合学的一般领域，特别是图论。组合数学试图找到有效的方法来研究如何组织离散的集合。 图是由线连接的点的排列。 像图这样的离散集合的行为在系统建模中非常重要，并且在现代计算，通信和操作中发挥着重要作用。 例如，大型网络的设计，如电话系统，以及计算机科学中算法的设计，都在其开发中使用图形，并利用组合研究。

9401981 Robertson This award supports the research of Professor G. Neil Robertson to work in combinatorics. Professor Robertson will continue his work on the graph minors project in an attempt to provide better information on finite graphs. The work will include an investigation into questions of coloring, surface embeddings, finite structure, and connectivity of graphs. The research is in the general area of combinatorics, in particular graph theory. Combinatorics attempts to find efficient methods to study how discrete collections can be organized. Graphs are arrangements of points connected by lines. The behavior of discrete collections like graphs is extremely important in modeling systems and plays a role in modern computing, communications and operations. For example, the design of large networks, as in telephone systems, and the design of algorithms in computer science all use graphs in their development, and make use of combinatorial research.