2023
DOI: 10.1007/s00493-023-00061-4
|View full text |Cite
|
Sign up to set email alerts
|

Induced Subgraphs of Induced Subgraphs of Large Chromatic Number

António Girão,
Freddie Illingworth,
Emil Powierski
et al.

Abstract: We prove that, for every graph F with at least one edge, there is a constant $$c_F$$ c F such that there are graphs of arbitrarily large chromatic number and the same clique number as F in which every F-free induced subgraph has chromatic number at most $$c_F$$ c F . This generalises recent theorems of Briański, Davies and Walczak, and Carboner… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 30 publications
0
0
0
Order By: Relevance