Simplicial tree-decompositions of infinite graphs. I (Q2641316): Difference between revisions

[For part II, cf. the following 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. A subgraph is attached if some component of its complement is adjacent to each of its vertices. It is convex iff it contains any simple path connecting two of its vertices. In this first of a series of three papers devoted to the study of simplicial tree-decompositions some basic properties are derived. E.g. a graph is prime iff it cannot be separated by a simplex. All factors in simplicial decompositions are unattached and prime factors are minimally convex and maximally prime. The paper culminates in a structure theorem for infinite graphs with a simplicial tree-decomposition into primes.