Universal graphs with a forbidden subgraph: Block path solidity

Gregory Cherlin*, Saharon Shelah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

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 languageEnglish
Pages (from-to)249-264
Number of pages16
JournalCombinatorica
Volume36
Issue number3
DOIs
StatePublished - 1 Jun 2016

Bibliographical note

Publisher Copyright:
© 2015, János Bolyai Mathematical Society and Springer-Verlag Berlin Heidelberg.

Fingerprint

Dive into the research topics of 'Universal graphs with a forbidden subgraph: Block path solidity'. Together they form a unique fingerprint.

Cite this