Universal graphs with a forbidden subgraph: Block path solidity

Gregory Cherlin, Saharon Shelah

Let C be a finite connected graph for which there is a countable universal C-free graph, and whose tree of blocks is a path. Then the blocks of C are complete. This generalizes a r…