Edge decomposition of 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.