Substitution and -Boundedness
Abstract
A class G of graphs is said to be -bounded if there is a function f:N → R such that for all G ∈ G and all induced subgraphs H of G, (H) ≤ f(ω(H)). In this paper, we show that if G is a -bounded class, then so is the closure of 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 is -bounded by a polynomial (respectively: exponential) function, then the closure of G under substitution is also -bounded by some polynomial (respectively: exponential) function. In addition, we show that if G is a -bounded class, then the closure of G under the operations of gluing along a clique and gluing along a bounded number of vertices together is also -bounded, as is the closure of G under the operations of substitution and gluing along a clique together.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.