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

DOI10.1002/JGT.20245zbMATH Open1131.03013OpenAlexW4248566802MaRDI QIDQ5434243FDOQ5434243

Authors: Lasse Tallgren, Gregory 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

Recommendations

• Universal graphs with a forbidden subtree
• Universal graphs with a forbidden subgraph: block path solidity
• Nonexistence of universal graphs without some trees
• Some remarks on universal graphs
• There is no universal countable pentagon‐free graph

zbMATH Keywords

model theoryforbidden subgraphuniversal graphbouquetexistential completenessdelta system

Mathematics Subject Classification ID

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

Cites Work

• A problem of Ulam on planar graphs

Cited In (12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434243)