Sh:1033
- Cherlin, G. L., & Shelah, S. (2016). Universal graphs with a forbidden subgraph: block path solidity. Combinatorica, 36(3), 249–264. arXiv: 1404.5757 DOI: 10.1007/s00493-014-3181-5 MR: 3521114
-
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. - Version 2014-01-19_11 (14p) published version (16p)
Bib entry
@article{Sh:1033,
author = {Cherlin, Gregory L. and Shelah, Saharon},
title = {{Universal graphs with a forbidden subgraph: block path solidity}},
journal = {Combinatorica},
fjournal = {Combinatorica. An International Journal on Combinatorics and the Theory of Computing},
volume = {36},
number = {3},
year = {2016},
pages = {249--264},
issn = {0209-9683},
mrnumber = {3521114},
mrclass = {03C15 (05C60 05C63)},
doi = {10.1007/s00493-014-3181-5},
note = {\href{https://arxiv.org/abs/1404.5757}{arXiv: 1404.5757}},
arxiv_number = {1404.5757}
}