Universal graphs with a forbidden near‐path or 2‐bouquet

DOI10.1002/jgt.20245zbMath1131.03013OpenAlexW4248566802MaRDI QIDQ5434243

Lasse Tallgren, Gregory L. Cherlin

Publication date: 4 January 2008

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20245

zbMATH Keywords

model theoryforbidden subgraphuniversal graphbouquetexistential completenessdelta system

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Models with special properties (saturated, rigid, etc.) (03C50) Model theory of denumerable and separable structures (03C15)

Related Items (10)

Universal graphs with a forbidden subtree ⋮ Universal graphs with a forbidden subgraph: block path solidity ⋮ Bowtie-free graphs have a Ramsey lift ⋮ Universality vs genericity and \(C_4\)-free graphs ⋮ Universal graphs for the topological minor relation ⋮ Bowtie‐free graphs and generic automorphisms ⋮ Ramsey properties and extending partial automorphisms forhbox classes of finite structures ⋮ INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)

Cites Work

• A problem of Ulam on planar graphs

This page was built for publication: Universal graphs with a forbidden near‐path or 2‐bouquet