Universal graphs with a forbidden subgraph: Block path solidity

Gregory Cherlin; Saharon Shelah

doi:10.1007/s00493-014-3181-5

Universal graphs with a forbidden subgraph: Block path solidity

Gregory Cherlin^*
, Saharon Shelah

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	249-264
Number of pages	16
Journal	Combinatorica
Volume	36
Issue number	3
DOIs	https://doi.org/10.1007/s00493-014-3181-5
State	Published - 1 Jun 2016

Bibliographical note

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

Access to Document

10.1007/s00493-014-3181-5

Cite this

@article{cecfb3869568441985977d392d6f00f9,

title = "Universal graphs with a forbidden subgraph: Block path solidity",

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{\"u}redi and Komj{\'a}th, and fits naturally into a set of conjectures regarding the existence of countable C-free graphs, with C an arbitrary finite connected graph.",

author = "Gregory Cherlin and Saharon Shelah",

note = "Publisher Copyright: {\textcopyright} 2015, J{\'a}nos Bolyai Mathematical Society and Springer-Verlag Berlin Heidelberg.",

year = "2016",

month = jun,

day = "1",

doi = "10.1007/s00493-014-3181-5",

language = "אנגלית",

volume = "36",

pages = "249--264",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "3",

}

TY - JOUR

T1 - Universal graphs with a forbidden subgraph

T2 - Block path solidity

AU - Cherlin, Gregory

AU - Shelah, Saharon

PY - 2016/6/1

Y1 - 2016/6/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84930014892

U2 - 10.1007/s00493-014-3181-5

DO - 10.1007/s00493-014-3181-5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84930014892

SN - 0209-9683

VL - 36

SP - 249

EP - 264

JO - Combinatorica

JF - Combinatorica

IS - 3

ER -

Universal graphs with a forbidden subgraph: Block path solidity

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this