课题基金 / 基金详情

DMS-EPRSC: Induced Subgraphs and Graph Structure

DMS-EPRSC: Induced Subgraphs and Graph Structure
DMS-EPRSC:归纳子图和图结构
批准号:
2154169
负责人:
Paul Seymour
金额:
$50.0万
依托单位:
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2022
资助国家:
美国
项目状态:
未结题
起止时间:
2022-07-01 至 2027-06-30

项目摘要

项目成果

Paul Seymour的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
This is a DMS-EPRSC project in structural graph theory. There are two natural ways to describe the local structure of a graph: by asking what graphs occur as minors, and by asking what graphs occur as induced subgraphs. The theory of graph minors was developed by Robertson and Seymour, and gives a very satisfactory picture. However, the picture for induced subgraphs is more complex and much less is known. The goal of this project is to extend the theory of induced subgraphs. What can we say about the graphs that have no induced subgraph of some special type? Graduate students will be trained as part of the project.A central problem in the field is the Erdos-Hajnal conjecture. It has been known since the results of Ramsey and of Erdos and of Szekeres in the 1930s that every graph has a clique or stable set of size at least logarithmic in the number of vertices. However, Erdos and Hajnal conjectured in the 1980s that forbidding any induced subgraph H causes a dramatic jump, resulting in cliques or stable sets of polynomial size.Recently the PIs (joint with two others) settled the smallest open case, which had been a famous question since the problem was first proposed in the 1980's; and even more recently they have made substantial progress on the next smallest case. These two steps both used new techniques, and it is hoped that these techniques will lead to further progress on this and related problems. More broadly, what is the structure that results when some graph is excluded as an induced subgraph? We don't expect to get a structure that is necessary and sufficient for excluding a particular graph (this already seems hopeless for excluding a six-vertex graph); but it is more likely that there is a structure that is necessary for excluding a given graph and sufficient for excluding some larger graph. This would be the first step towards a general structural theory for induced subgraphs.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.
期刊论文(8)
专著(0)
科研奖励(0)
会议论文
Erdős–Hajnal for graphs with no 5‐hole
ErdÅsâHajnal 用于没有 5 孔的图
DOI: 10.1112/plms.12504
发表时间: 2023
期刊: Proceedings of the London Mathematical Society
影响因子: 1.8
作者: [Chudnovsky, Maria, Scott, Alex, Seymour, Paul, Spirkl, Sophie]
通讯作者: Spirkl, Sophie
Proof of a conjecture of Plummer and Zha
Plummer 和 Zha 猜想的证明
DOI: 10.1002/jgt.22926
发表时间: 2023
期刊: Journal of Graph Theory
影响因子: 0.9
作者: [Chudnovsky, Maria, Seymour, Paul]
通讯作者: Seymour, Paul
DOI: 10.1016/j.jctb.2023.03.001
发表时间: 2023
期刊: Series B
影响因子: --
作者: [Scott, Alex, Seymour, Paul, Spirkl, Sophie]
通讯作者: Spirkl, Sophie
DOI: 10.1007/s00493-023-00025-8
发表时间: 2023
期刊: Combinatorica
影响因子: 1.1
作者: [Scott, Alex, Seymour, Paul, Spirkl, Sophie]
通讯作者: Spirkl, Sophie
8
    Induced Subgraphs and Coloring
    • 批准号:
      1800053
    • 项目类别:
      Continuing Grant
    • 资助金额:
      $21.0万
    • 财政年份:
      2018
    • 负责人:
      Paul Seymour
    • 依托单位:
    Collaborative Research: cliques, stable sets and approximate structure
    • 批准号:
      1265563
    • 项目类别:
      Continuing Grant
    • 资助金额:
      $24.0万
    • 财政年份:
      2013
    • 负责人:
      Paul Seymour
    • 依托单位:
    Tournament Immersion and Rao's Conjecture
    • 批准号:
      0901075
    • 项目类别:
      Standard Grant
    • 资助金额:
      $22.0万
    • 财政年份:
      2009
    • 负责人:
      Paul Seymour
    • 依托单位:
    FRG: Collaborative Research: The Four-Color Theorem and Beyond
    • 批准号:
      0354465
    • 项目类别:
      Standard Grant
    • 资助金额:
      $28.33万
    • 财政年份:
      2004
    • 负责人:
      Paul Seymour
    • 依托单位:
    海外基金