Clique-sums, tree-decompositions and compactness (Q1813735)

The results presented in this paper seem to be in the line with previous papers of Robertson and Seymour. Five definitions fix basic ideas related with tree decompositions, cliques, \(k\)-simplexes, \(k\)-complexes and chordal graphs as well as \(k\)-summability and other related subjects. A prime graph decomposition existence criterion is derived for infinite graphs. A key result is that if every subgraph of a graph \(G\) is a subgraph of a \(k\)-complex of a previously fixed class, then \(G\) has the same property. A descriptive analysis of the relationships between the excluded minors and different structural aspects of the finite and infinite case is developed.