Universal graphs with a forbidden subtree

DOI10.1016/j.jctb.2006.05.008zbMath1116.03026DBLPjournals/jct/CherlinS07arXivmath/0512218OpenAlexW2117331177WikidataQ28112265 ScholiaQ28112265MaRDI QIDQ875935

Saharon Shelah, Gregory L. Cherlin

Publication date: 16 April 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0512218

zbMATH Keywords

treemodel theoryforbidden subgraphuniversal graph

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Models with special properties (saturated, rigid, etc.) (03C50) Other model constructions (03C30)

Related Items (6)

Universal graphs with a forbidden subgraph: block path solidity ⋮ A note on classes of subgraphs of locally finite graphs ⋮ Universal graphs for the topological minor relation ⋮ Induced subgraphs of zero-divisor graphs ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)

Cites Work

• Unnamed Item
• Some universal graphs
• Universal graphs with forbidden subgraphs and algebraic closure
• Universal arrow-free graphs
• Nonexistence of universal graphs without some trees
• Forbidden subgraphs and forbidden substructures
• Universal graphs without large bipartite subgraphs
• On the existence of countable universal graphs
• Graphs omitting a finite set of cycles
• Universal graphs with a forbidden near‐path or 2‐bouquet
• Some remarks on universal graphs

This page was built for publication: Universal graphs with a forbidden subtree