Scott's induced subdivision conjecture for maximal triangle-free graphs
classification
🧮 math.CO
keywords
graphsconjectureinducedmaximalscottsubdivisiontriangle-freebounded
read the original abstract
Scott conjectured that the class of graphs with no induced subdivision of a given graph is $\chi$-bounded. We verify his conjecture for maximal triangle-free graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.