Forbidden subgraphs and forbidden substructures

DOI10.2307/2695110zbMath0986.03029OpenAlexW2159942286MaRDI QIDQ2758062

Niandong Shi, Gregory L. Cherlin

Publication date: 3 June 2002

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2695110

zbMATH Keywords

graphcolored graphforbidden subgraphuniversal graphuniversal structureforbidden substructure

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Structural characterization of families of graphs (05C75) Decidability of theories and sets of sentences (03B25) Coloring of graphs and hypergraphs (05C15) Models of other mathematical theories (03C65) Model theory of denumerable and separable structures (03C15)

Related Items (6)

Universal graphs with a forbidden subtree ⋮ Bowtie-free graphs have a Ramsey lift ⋮ Many Facets of Dualities ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms) ⋮ Ramsey theory for countable binary homogeneous structures

Cites Work

• Some universal graphs
• Universal elements and the complexity of certain classes of infinite graphs
• Universal graphs with forbidden subgraphs and algebraic closure
• ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE
• On the existence of countable universal graphs
• Graphs omitting a finite set of cycles

This page was built for publication: Forbidden subgraphs and forbidden substructures