Universal graphs with forbidden subgraphs and algebraic closure

DOI10.1006/aama.1998.0641zbMath0928.03049arXivmath/9809202OpenAlexW1988705590WikidataQ56504571 ScholiaQ56504571MaRDI QIDQ1293133

Niandong Shi, Saharon Shelah, Gregory L. Cherlin

Publication date: 28 June 1999

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

model completenessexistentially closed modelsexistential completenessexistence of countable universal graphsfinitely many forbidden subgraphsgrowth rate of the algebraic closure of finite sets

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Applications of model theory (03C98) Model theory of denumerable and separable structures (03C15)

Related Items (27)

Ramsey classes with forbidden homomorphisms and a closure ⋮ When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems ⋮ Universal graphs with a forbidden subtree ⋮ Consistent amalgamation for þ-forking ⋮ Bowtie-free graphs have a Ramsey lift ⋮ Universality vs genericity and \(C_4\)-free graphs ⋮ Ramsey theorem for designs ⋮ Bowtie‐free graphs and generic automorphisms ⋮ On the order of countable graphs ⋮ Many Facets of Dualities ⋮ 2006–07 Winter Meeting of the Association for Symbolic Logic ⋮ 𝜔-categorical structures avoiding height 1 identities ⋮ Ramsey properties and extending partial automorphisms forhbox classes of finite structures ⋮ Forbidden subgraphs and forbidden substructures ⋮ INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES ⋮ 2006 Annual Meeting of the Association for Symbolic Logic ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Supersaturation problem for the bowtie ⋮ A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP ⋮ Automorphism groups of finite topological rank ⋮ Unnamed Item ⋮ An algebraic view on p-admissible concrete domains for lightweight description logics ⋮ AN AXIOMATIC APPROACH TO FREE AMALGAMATION ⋮ All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms) ⋮ Using model theory to find decidable and tractable description logics with concrete domains ⋮ Cuts and bounds ⋮ ASNP: a tame fragment of existential second-order logic

Cites Work

• Unnamed Item
• Unnamed Item
• Some universal graphs
• A problem of Ulam on planar graphs
• Model theory.
• Universal elements and the complexity of certain classes of infinite graphs
• Forcing, arithmetic, division rings
• Universal arrow-free graphs
• Nonexistence of universal graphs without some trees
• Graphs omitting sums of complete graphs
• On maximal paths and circuits of graphs
• Universal graphs without large bipartite subgraphs
• The strong amalgamation property
• There is no universal countable pentagon‐free graph
• On the existence of countable universal graphs
• Graphs omitting a finite set of cycles
• Universal graphs and universal functions

This page was built for publication: Universal graphs with forbidden subgraphs and algebraic closure