Simplicial tree-decompositions of infinite graphs. II: The existence of prime decompositions (Q2641317): Difference between revisions

[For part I, cf. the preceding review.] A simplicial tree-decomposition of a graph is a covering family of induced subgraphs (factors), indexed by some ordinal, which overlap only by simplices (complete subgraphs). A graph is called prime if it does not allow a (simplicial) tree-decomposition. In this second of a series of three papers on the subject a characterization is obtained of those countable graphs admitting a simplicial tree-decomposition into primes, i.e. such that each factor is prime.