Infinite Antichains of Graphs

小行星9400946 该奖项资助了丁国立教授在图论方面的研究。丁教授在Graph Minors项目工作。 他使用这个项目的技术来研究图的无限反链，相对于图的包容性，拓扑未成年人和诱导子图。 该研究是在组合学的一般领域，特别是图论。组合数学试图找到有效的方法来研究如何组织离散的集合。 图是由线连接的点的排列。 像图这样的离散集合的行为在系统建模中非常重要，并且在现代计算，通信和操作中发挥着重要作用。 例如，大型网络的设计，如电话系统，以及计算机科学中算法的设计，都在其开发中使用图形，并利用组合研究。

9400946 Ding This award funds the research of Professor Guoli Ding in graph theory. Prof. Ding works on the Graph Minors Project. He uses the techniques of this project to study infinite antichains of graphs relative to graph containment, topological minors, and induced subgraphs. 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.