Topological Minors of Graphs

丁9700623该奖项提供经费，用于研究涉及拓扑学未成年人的三个基本问题。第一个问题是Robertson的双路猜想，它指出如果一类图G在拓扑子集下是闭的，并且没有任意长的双路，则G不包含关于拓扑子集关系的无限反链。这是图论中的一个基本猜想。它将结构图论、组合优化和经典组合学联系在一起。PI已经在解决这一猜想方面取得了重大进展，包括但不限于证明了所有次闭图类和最多三个割宽的图类的猜想。他希望他过去在这个问题上的经验和他的一些新想法将帮助他完全解决这个猜想。第二个问题是Hajos猜想的边缘版本。最近，PI通过确定所有色指数大于n的次极小图建立了Hadwiger猜想的边版本。现在他建议研究色指数大于n的拓扑次极小图。这正是Hajos猜想的边版本，该猜想声称K_n是唯一的色数大于n的拓扑次极小图。这个问题不仅与Hajos猜想和Hadwiger猜想有关，还与Viving的平面图猜想和该领域的几个著名结果有关。第三个问题涉及不可避免的大交叉数的图。交叉数是一个典型的图参数，它对于拓扑-次关系是单调的，而对于次关系不是单调的。关于这个参数的一个自然问题是理解是什么使交叉数很大。一个明显的原因是图表的高亏格。还有其他原因。例如，对于某个较大的n，拓扑子式D_n的包含可以使交叉数变大。PI建议刻画具有较大交叉数的不可避免图的完全列表。这项研究属于组合学的一般领域。组合学的目标之一是找到有效的方法来研究离散的对象集合如何排列。离散系统的行为对于现代通信来说是极其重要的。例如，大型网络的设计，如那些发生在电话系统中的网络，以及计算机科学中的算法设计，都涉及离散的对象集，这利用了组合研究。

Ding 9700623 This award provides funds for an investigation of three fundamental problems involving topological minors. The first problem is Robertson's double-path conjecture, which states that if a class G of graphs is closed under topological minors and is free of arbitrarily long double-paths, then G does not contain infinite antichains with respect t o the topological-minor relation. This is a fundamental conjecture in graph theory. It relates structural graph theory, combinatorial optimization, and classical combinatorics. The PI has made significant progress towards solving this conjecture, which includes, but is not limited to, proving the conjecture for all minor-closed classes of graphs and for the class of graphs of cutwidth at most three. He hopes that his past experience on this problem together with some of his new ideas will help him to settle this conjecture completely. The second problem is the edge version of Hajos' conjecture. Recently, the PI has established the edge version of Hadwiger's conjecture by identifying all minor- minimal graphs with chromatic index greater than n. Now he proposes to study topological-minor-minimal graphs with chromatic index greater than n. This is exactly the edge version of Hajos' conjecture, which claims that K_n is the only topological-minor-minimal graph with chromatic number greater than n. This problem relates not only to Hajos' conjecture and Hadwiger's conjecture, but also to Vizing's planar graph conjecture and several well-known results in this field. The third problem concerns unavoidable graphs of large crossing number. Crossing number is a typical graph parameter that is monotone with respect to the topological-minor relation but not with respect to the minor relation. A natural problem concerning this parameter is to understand what makes the crossing number big. One obvious cause is a high genus for the graph. There are also other causes. For example, for some large n, the containment of a topological minor D_ n can make the crossing number large. The PI proposes to characterize the complete list of unavoidable graphs of large crossing number. This research is in the general area of Combinatorics. One of the goals of Combinatorics is to find efficient methods of studying how discrete collections of objects can be arranged. The behavior of discrete systems is extremely important to modern communications. For example, the design of large networks, such as those occurring in telephone systems, and the design of algorithms in computer science deal with discrete sets of objects, and this makes use of combinatorial research.