English

Substitution and $\chi$-Boundedness

Combinatorics 2013-09-09 v1

Abstract

A class G\mathcal{G} of graphs is said to be {\em χ\chi-bounded} if there is a function f:NRf:\mathbb{N} \rightarrow \mathbb{R} such that for all GGG \in \mathcal{G} and all induced subgraphs HH of GG, χ(H)f(ω(H))\chi(H) \leq f(\omega(H)). In this paper, we show that if G\mathcal{G} is a χ\chi-bounded class, then so is the closure of G\mathcal{G} under any one of the following three operations: substitution, gluing along a clique, and gluing along a bounded number of vertices. Furthermore, if G\mathcal{G} is χ\chi-bounded by a polynomial (respectively: exponential) function, then the closure of G\mathcal{G} under substitution is also χ\chi-bounded by some polynomial (respectively: exponential) function. In addition, we show that if G\mathcal{G} is a χ\chi-bounded class, then the closure of G\mathcal{G} under the operations of gluing along a clique and gluing along a bounded number of vertices together is also χ\chi-bounded, as is the closure of G\mathcal{G} under the operations of substitution and gluing along a clique together.

Keywords

Cite

@article{arxiv.1302.1145,
  title  = {Substitution and $\chi$-Boundedness},
  author = {Maria Chudnovsky and Irena Penev and Alex Scott and Nicolas Trotignon},
  journal= {arXiv preprint arXiv:1302.1145},
  year   = {2013}
}
R2 v1 2026-06-21T23:21:18.569Z