Universal graphs with a forbidden subtree

Gregory Cherlin; Saharon Shelah

doi:10.1016/j.jctb.2006.05.008

Universal graphs with a forbidden subtree

Gregory Cherlin^*, Saharon Shelah

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

Abstract

We show that the problem of the existence of universal graphs with specified forbidden subgraphs can be systematically reduced to certain critical cases by a simple pruning technique which simplifies the underlying structure of the forbidden graphs, viewed as trees of blocks. As an application, we characterize the trees T for which a universal countable T-free graph exists.

Original language	English
Pages (from-to)	293-333
Number of pages	41
Journal	Journal of Combinatorial Theory. Series B
Volume	97
Issue number	3
DOIs	https://doi.org/10.1016/j.jctb.2006.05.008
State	Published - May 2007

Keywords

Forbidden subgraph
Graph
Model theory
Tree
Universal graph

Access to Document

10.1016/j.jctb.2006.05.008

Cite this

@article{13c4c31f12b9400f92799f9ec487fcf3,

title = "Universal graphs with a forbidden subtree",

abstract = "We show that the problem of the existence of universal graphs with specified forbidden subgraphs can be systematically reduced to certain critical cases by a simple pruning technique which simplifies the underlying structure of the forbidden graphs, viewed as trees of blocks. As an application, we characterize the trees T for which a universal countable T-free graph exists.",

keywords = "Forbidden subgraph, Graph, Model theory, Tree, Universal graph",

author = "Gregory Cherlin and Saharon Shelah",

year = "2007",

month = may,

doi = "10.1016/j.jctb.2006.05.008",

language = "אנגלית",

volume = "97",

pages = "293--333",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - Universal graphs with a forbidden subtree

AU - Cherlin, Gregory

AU - Shelah, Saharon

PY - 2007/5

Y1 - 2007/5

N2 - We show that the problem of the existence of universal graphs with specified forbidden subgraphs can be systematically reduced to certain critical cases by a simple pruning technique which simplifies the underlying structure of the forbidden graphs, viewed as trees of blocks. As an application, we characterize the trees T for which a universal countable T-free graph exists.

AB - We show that the problem of the existence of universal graphs with specified forbidden subgraphs can be systematically reduced to certain critical cases by a simple pruning technique which simplifies the underlying structure of the forbidden graphs, viewed as trees of blocks. As an application, we characterize the trees T for which a universal countable T-free graph exists.

KW - Forbidden subgraph

KW - Graph

KW - Model theory

KW - Tree

KW - Universal graph

UR - http://www.scopus.com/inward/record.url?scp=33847621716&partnerID=8YFLogxK

U2 - 10.1016/j.jctb.2006.05.008

DO - 10.1016/j.jctb.2006.05.008

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

AN - SCOPUS:33847621716

SN - 0095-8956

VL - 97

SP - 293

EP - 333

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

IS - 3

ER -

Universal graphs with a forbidden subtree

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this