Universal graphs with a forbidden subgraph: block path solidity

DOI10.1007/s00493-014-3181-5zbMath1389.05112arXiv1404.5757OpenAlexW1513497564MaRDI QIDQ1677537

Gregory L. Cherlin, Saharon Shelah

Publication date: 10 November 2017

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

connected graphforbidden subgraphblock path

Mathematics Subject Classification ID

Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Model theory of denumerable and separable structures (03C15) Infinite graphs (05C63)

Related Items (7)

Bowtie-free graphs have a Ramsey lift ⋮ A note on classes of subgraphs of locally finite graphs ⋮ Universal graphs for the topological minor relation ⋮ Ramsey properties and extending partial automorphisms forhbox classes of finite structures ⋮ More on the revised GCH and the black box ⋮ All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms) ⋮ Universal graphs omitting finitely many finite graphs

Cites Work

• Club guessing and the universal models
• Universal graphs with a forbidden subtree
• Universal elements and the complexity of certain classes of infinite graphs
• On the existence of countable universal graphs
• Universal graphs with a forbidden near‐path or 2‐bouquet
• A family of countable homogeneous graphs

This page was built for publication: Universal graphs with a forbidden subgraph: block path solidity