Research on Graph Coloring and Graph Structure
Research on Graph Coloring and Graph Structure
批准号:
2348702
负责人:
Xingxing Yu
金额:
$26.08万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2024
资助国家:
美国
项目状态:
未结题
起止时间:
2024-06-01 至 2027-05-31
中文摘要
本研究项目研究图中某些构型的存在,以及这些构型与图的整体性质之间的关系。一个著名的例子是四色定理,该定理指出,如果一个图不包含两个特定的构型,那么它是平面的,并且它的顶点最多可以划分为四个集合,每个集合中没有边。这个项目寻求其他配置的类似结果,以及保证图中存在某些配置(如圈和匹配)的充分条件。本课题还研究了适合研究生的图的圈和超图的匹配问题。本课题研究了图的着色和图的结构两个问题。Hajos猜想不包含5点完全图的剖分的图是4-可染的,从而推广了四色定理。关于这一猜想的前人工作使人们对这些图的结构有了实质性的了解,以及它与几个与图结构有关的重要问题的联系,包括关于非分离路的Lovasz猜想和关于3-链图的Thomassen猜想。另一个问题涉及将不包含给定树的图的色数定为导出子图。将考虑使用特殊的树木来洞察这一问题。这一奖项反映了NSF的法定使命,并通过使用基金会的智力优势和更广泛的影响审查标准进行评估,被认为值得支持。
英文摘要
This research project studies the existence of certain configurations in graphs, as well as connections between those configurations and global properties of graphs. A well-known example is the Four-Color Theorem, which states that if a graph does not contain two specific configurations, then it is planar, and its vertices can be partitioned into at most four sets with no edges within each set. This project seeks similar results for other configurations, as well as sufficient conditions that guarantee the existence of certain configurations (such as cycles and matchings) in graphs. This project also contains research problems related to cycles in graphs and matchings in hypergraphs that are suitable for graduate students.This research project investigates two problems on graph coloring and graph structure. Hajos conjectured that graphs containing no subdivision of the 5-vertex complete graph are 4-colorable, which would generalize the Four-Color Theorem. Prior work on this conjecture led to the substantial understanding of the structure of those graphs, as well as its connections to several important problems concerning graph structures, including Lovasz's conjecture on non-separating paths and Thomassen's conjecture on 3-linked graphs. Another problem involves bounding the chromatic number of graphs not containing a given tree as an induced subgraph. Special trees will be considered to gain insight into this problem.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)
会议论文
Conference: Atlanta Lecture Series in Combinatorics and Graph Theory
-
批准号:2321249
-
项目类别:Continuing Grant
-
资助金额:$6.0万
-
财政年份:2023
-
负责人:Xingxing Yu
-
依托单位:
Disjoint Paths in Graphs and Coloring
-
批准号:1954134
-
项目类别:Continuing Grant
-
资助金额:$16.0万
-
财政年份:2020
-
负责人:Xingxing Yu
-
依托单位:
Topological Minors, Connectivity, and Partitions
-
批准号:1600738
-
项目类别:Continuing Grant
-
资助金额:$24.0万
-
财政年份:2016
-
负责人:Xingxing Yu
-
依托单位:
Atlanta Lecture Series in Combinatorics and Graph Theory, 2014/2015
-
批准号:1400055
-
项目类别:Standard Grant
-
资助金额:$2.21万
-
财政年份:2014
-
负责人:Xingxing Yu
-
依托单位:
Graph structures and applications
-
批准号:1265564
-
项目类别:Continuing Grant
-
资助金额:$16.0万
-
财政年份:2013
-
负责人:Xingxing Yu
-
依托单位:
Collaborative Research: Atlanta Lecture Series on Combinatorics and Graph Theory
-
批准号:1001743
-
项目类别:Standard Grant
-
资助金额:$0.47万
-
财政年份:2010
-
负责人:Xingxing Yu
-
依托单位:
Some Problems Related to Graph Connectivity
-
批准号:0245530
-
项目类别:Standard Grant
-
资助金额:$10.5万
-
财政年份:2003
-
负责人:Xingxing Yu
-
依托单位:
Paths, Cycles, and Spanning Subgraphs
-
批准号:9970527
-
项目类别:Standard Grant
-
资助金额:$8.0万
-
财政年份:1999
-
负责人:Xingxing Yu
-
依托单位:
Disjoint Paths and Hamilton Cycles
-
批准号:9531824
-
项目类别:Standard Grant
-
资助金额:$6.0万
-
财政年份:1996
-
负责人:Xingxing Yu
-
依托单位:
Mathematical Sciences: Cycles and Subdivisions in Graphs
-
批准号:9301909
-
项目类别:Continuing Grant
-
资助金额:$6.0万
-
财政年份:1993
-
负责人:Xingxing Yu
-
依托单位:
Mathematical Sciences: Contractible Edges, Cycle Covers, andApplications
-
批准号:9105173
-
项目类别:Continuing Grant
-
资助金额:$3.8万
-
财政年份:1991
-
负责人:Xingxing Yu
-
依托单位:
国内基金
海外基金
登录
查看更多内容
基于Graph-PINN的层结稳定度参数化建模与沙尘跨介质耦合传输模拟研
-
批准号:
-
项目类别:省市级项目
-
资助金额:--
-
批准年份:2025
-
负责人:梅奥
-
依托单位:
平面三角剖分flip graph的强凸性研究
-
批准号:12301432
-
项目类别:青年科学基金项目
-
资助金额:30.00万元
-
批准年份:2023
-
负责人:王子丽
-
依托单位:
基于graph的多对比度磁共振图像重建方法
-
批准号:61901188
-
项目类别:青年科学基金项目
-
资助金额:24.5万元
-
批准年份:2019
-
负责人:赖宗英
-
依托单位:
基于de bruijn graph梳理的宏基因组拼接算法开发
-
批准号:61771009
-
项目类别:面上项目
-
资助金额:50.0万元
-
批准年份:2017
-
负责人:李国君
-
依托单位:
基于Graph和ISA的红外目标分割与识别方法研究
-
批准号:61101246
-
项目类别:青年科学基金项目
-
资助金额:22.0万元
-
批准年份:2011
-
负责人:刘靳
-
依托单位:
中国Web Graph的挖掘与应用研究
-
批准号:60473122
-
项目类别:面上项目
-
资助金额:23.0万元
-
批准年份:2004
-
负责人:俞勇
-
依托单位: