Abstract
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 result of Füredi and Komjáth, and fits naturally into a set of conjectures regarding the existence of countable C-free graphs, with C an arbitrary finite connected graph.
Original language | English |
---|---|
Pages (from-to) | 249-264 |
Number of pages | 16 |
Journal | Combinatorica |
Volume | 36 |
Issue number | 3 |
DOIs | |
State | Published - 1 Jun 2016 |
Bibliographical note
Publisher Copyright:© 2015, János Bolyai Mathematical Society and Springer-Verlag Berlin Heidelberg.