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丁国利教授在图论方面的研究。丁教授从事图形未成年人项目。他使用这个项目的技术来研究图的无限反链，相对于图的包容，拓扑子图，和诱导子图。研究范围是组合学的一般领域，特别是图论。组合学试图找到有效的方法来研究如何组织离散集合。图是由直线连接的点的排列。离散集合（如图）的行为在系统建模中非常重要，在现代计算、通信和操作中起着重要作用。例如，大型网络的设计，如电话系统，以及计算机科学算法的设计，都在其发展中使用图，并利用组合研究。