Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree

Author:

Scott Alex1ORCID,Seymour Paul2ORCID,Spirkl Sophie3ORCID

Affiliation:

1. Mathematical Institute University of Oxford Oxford UK

2. Princeton University Princeton New Jersey USA

3. University of Waterloo Waterloo Ontario Canada

Funder

Air Force Office of Scientific Research

Engineering and Physical Sciences Research Council

Natural Sciences and Engineering Research Council of Canada

National Science Foundation

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference15 articles.

1. Degeneracy of P-free and C⩾-free graphs with no large complete bipartite subgraphs

2. M.Briański J.Davies andB.Walczak Separating polynomialχ\unicode{x003C7}‐boundedness fromχ\unicode{x003C7}‐boundedness arXiv:2201.08814.

3. Induced subgraphs of graphs with large chromatic number. XII. Distant stars

4. Graph Theory and Probability

5. L.Esperet Graph colorings flows and perfect matchings Habilitation thesis Université Grenoble Alpes  2017 p. 24.

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3