Infinite Antichains of Graphs

图的无限反链

• 批准号: 9400946
• 负责人: Guoli Ding
• 金额: $ 5.12万
• 依托单位: Louisiana State University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1994
• 资助国家: 美国
• 起止时间: 1994-06-01 至 1997-11-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9400946&HistoricalAwards=false
• 关键词: Infinite; Antichains; Graphs

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.

9400946该奖项为图理论中的鸟鸟教授的研究提供了资金。 Ding教授在图形未成年人项目上工作。 他使用该项目的技术来研究相对于图形遏制，拓扑未成年人和诱导子图的无限图抗。 该研究在组合学的一般领域，特别是图理论。组合学试图找到有效的方法来研究如何组织离散收集。 图是通过线连接的点的排列。 离散集合之类的行为在建模系统中极为重要，并且在现代计算，通信和操作中发挥作用。 例如，大型网络的设计，如电话系统中，以及计算机科学中算法的设计，都在开发中使用图形，并利用组合研究。