Edge decomposition of dense graphs

稠密图的边分解

• 批准号: FT160100048
• 负责人: A/Prof Daniel Horsley
• 金额: $ 53.61万
• 依托单位: Monash University
• 依托单位国家: 澳大利亚
• 项目类别: ARC Future Fellowships
• 财政年份: 2017
• 资助国家: 澳大利亚
• 起止时间: 2017-06-30 至 2022-10-31
• 项目状态: 已结题
• 来源: https://dataportal.arc.gov.au/RGS/Web/Grants/FT160100048
• 关键词: Edge; decomposition; dense; graphs

This project aims to address the edge decomposition of dense graphs, including the Nash-Williams conjecture. Edge decomposition of graphs is important for the mathematical fields of graph theory, combinatorial design theory and finite geometry, and also has strong applications to digital communication and information technologies. It is anticipated that the project will result in methods for edge decomposition of dense graphs, the solution of famous open problems, and a deeper, more cohesive understanding of edge decomposition.

这个项目旨在解决稠密图的边分解，包括Nash-Williams猜想。图的边分解在图论、组合设计理论和有限几何等数学领域有着重要的应用，在数字通信和信息技术中也有着重要的应用。预计该项目将导致稠密图的边缘分解方法，著名的开放问题的解决方案，以及对边缘分解更深入，更有凝聚力的理解。