Hadwiger's Conjecture and Ramsey Related Problems
Hadwiger's Conjecture and Ramsey Related Problems
批准号:
1854903
负责人:
Zixia Song
金额:
$15.0万
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2019
资助国家:
美国
项目状态:
已结题
起止时间:
2019-06-01 至 2024-05-31
中文摘要
本研究计画旨在研究结构图理论与极值组合学领域的各种基本问题。 这些问题通常与其他领域有关,包括理论计算机科学、几何学、信息论、调和分析和数论。这些问题的进展将促进我们对图论和组合学相关方面的理解。PI和她的合作者最近在其中大多数方面取得了进展。 预计对这些问题的进一步研究将导致新的方法和应用。 该项目研究与著名的Hadwiger猜想和Ramsey相关的问题。具体地说,PI和她的合作者计划探索以下问题:证明每个在7个顶点上没有团子的图都是7-可着色的;推广马德尔界到没有团子的图;研究独立数为2的图的Hadwiger猜想的最小反例;研究具有小Colin de Verdiere参数的图的极值函数;确定偶数周期、车轮和 完全图;估计共临界图的最小边数。在这些问题上的进展无疑将导致新的方法和途径的发展,这是太遥远的遥不可及的,并有可能允许进一步令人兴奋的发展。这个奖项反映了NSF的法定使命,并已被认为是值得通过使用基金会的智力价值和更广泛的影响审查标准进行评估的支持。
英文摘要
This research project aims to study a variety of fundamental problems in the areas of structural graph theory and extremal combinatorics. Often such problems are related to other areas including theoretical computer science, geometry, information theory, harmonic analysis and number theory. Progress on these problems will advance our understanding of related aspects of graph theory and combinatorics. The PI and her collaborators have recently made progress on most of them. It is expected that further work on these problems will lead to new methods and applications. The project investigates problems related to the well-known Hadwiger's conjecture and Ramsey related problems. Specifically the PI and her collaborators plan to explore the following problems: proving every graph with no clique minor on seven vertices is 7-colorable; generalizing Mader's bound for graphs with no clique minors; studying the minimal counterexamples to Hadwiger's conjecture for graphs with independence number two; and studying the extremal function for graphs with small Colin de Verdiere parameter; determining the exact values of Gallai-Ramsey numbers of even cycles, wheels, and complete graphs; and estimating the minimum number of edges of co-critical graphs. Progress on these problems will undoubtedly lead to the development of new methods and approaches that were too far out of reach before, and are likely to allow further exciting developments.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Coloring Graphs with Forbidden Structures and Investigations Related to Ramsey Theory
-
批准号:2153945
-
项目类别:Standard Grant
-
资助金额:$18.0万
-
财政年份:2022
-
负责人:Zixia Song
-
依托单位:
Thirty-First Cumberland Conference on Combinatorics, Graph Theory and Computing
-
批准号:1902677
-
项目类别:Standard Grant
-
资助金额:$1.6万
-
财政年份:2019
-
负责人:Zixia Song
-
依托单位:
海外基金