On the problem of finding small subdivision and homomorphism bases for classes of countable graphs (Q1061752): Difference between revisions

Let \({\mathcal G}\) be a class of countable graphs given by a set \(\Gamma\) of forbidden configurations. We consider the following problem: for which \(\Gamma\) is \({\mathcal G}\) well characterized by the simplicial decompositions of its members into prime graphs, that is for which \({\mathcal G}\) is it possible to find a small subset \({\mathcal B}\) of \({\mathcal G}\) such that all graphs of \({\mathcal G}\) can be constructed from elements of \({\mathcal B}\) by successive amalgamations identifying complete subgraphs?