Advances in Graph and Matroid Structure Theory

主要研究者：Dijen K Ray-Chaudhuri提案编号：DMS-0302221机构：俄亥俄州州立大学标题：图和拟阵结构理论的进展摘要本次会议旨在促进数学问题，这是重要的今天图论，沿着由W。T. Tutte和G.尼尔·罗伯逊和他的同事们。 因此，图论中的基本主题，如连通性，表面和空间嵌入，良好的准序，色理论，无限排除子项和有向图，通过它们的结构特征找到共同的联系。 此外，拟阵理论、多项式时间图算法与组合优化和计算复杂性的关系等密切的课题也将包含在会议的框架内。作业调度、运输网络、保密通信的数据加密等大规模的实际计算问题，通常可以用数学的分支图论的问题来表述。 图着色问题是一个非常有实际意义的问题。 由Robertson和Seymour发展的图的结构理论解决了这些领域中的重要实际应用问题。 这次会议将汇集专家，促进互动和研究的图论和相关理论称为拟阵理论的问题的进展

Principal Investigator: Dijen K Ray-ChaudhuriProposal Number: DMS- 0302221Institution: Ohio State University Title: Advances in Graph and Matroid Structure Theory Abstract This conference is intended to foster the mathematical issues that are important to present day graph theory, along the lines pioneered by Prof. W. T. Tutte and continued by G. Neil Robertson and his coworkers. As such, fundamental topics in graph theory like connectivity, surface and spatial embeddings, well-quasi-ordering, chromatic theory, infinite excluded minors, and directed graphs find common links through their structural features. Moreover, within the conference framework the organizers intend to include close subjects such as matroid theory and ties through polynomial-time graph algorithms to combinatorial optimization and computational complexity.Large-scale practical computational problems such as job scheduling, transportation networks, and data encryption for the purpose of secured secret communication can often be formulated as problems in the branch of mathematics called graph theory. Graph coloring problems are of particular practical interest. The structure theory of graphs developed by Robertson and Seymour has solved important problems with practical applications in these areas. This conference will bring together experts to foster interaction and advances in research of problems of graph theory and a related theory called matroid theory