![](/files/happy5.png)
excluded subgraph
Graphs with a forbidden induced tree are chi-bounded ★★★
Author(s): Gyarfas
Say that a family of graphs is
-bounded if there exists a function
so that every
satisfies
.
Conjecture For every fixed tree
, the family of graphs with no induced subgraph isomorphic to
is
-bounded.
![$ T $](/files/tex/79f55d2e1d83a7726c807a70cbe756713b0437b6.png)
![$ T $](/files/tex/79f55d2e1d83a7726c807a70cbe756713b0437b6.png)
![$ \chi $](/files/tex/0308ad82f7a52e8b5406c475bffba60ea6867b7a.png)
Keywords: chi-bounded; coloring; excluded subgraph; tree
![Syndicate content Syndicate content](/misc/feed.png)