The Oberwolfach Problem and related Graph Factorisations

Oberwolfach 问题和相关的图因式分解

• 批准号: DP150100530
• 负责人: Prof Darryn Bryant
• 金额: $ 22.02万
• 依托单位: The University of Queensland
• 依托单位国家: 澳大利亚
• 项目类别: Discovery Projects
• 财政年份: 2015
• 资助国家: 澳大利亚
• 起止时间: 2015-01-01 至 2018-12-31
• 项目状态: 已结题
• 来源: https://dataportal.arc.gov.au/RGS/Web/Grants/DP150100530
• 关键词: Oberwolfach; Problem; related; Graph; Factorisations

Graph factorisation is an active area of research in combinatorial mathematics that is driven both by theoretical questions and by new and varied applications, particularly in digital communication and information technologies. The aim of this project is to solve the Oberwolfach Problem: a fundamental and historically significant graph factorisation question that has intrigued researchers for decades. Building on recent breakthroughs, new and widely applicable graph factorisation techniques are intended to be developed. The project outcomes are expected to have ongoing influence and impact on research in the field.

图因子分解是组合数学中的一个活跃研究领域，由理论问题和新的各种应用驱动，特别是在数字通信和信息技术中。这个项目的目的是解决Oberwolfach问题：一个基本的和历史上重要的图分解问题，几十年来一直吸引着研究人员。基于最近的突破，新的和广泛适用的图形因式分解技术的目的是开发。预计项目成果将对该领域的研究产生持续的影响。