Definability in the substructure ordering of simple graphs

DOI10.1007/S00026-015-0295-4zbMATH Open1332.05139OpenAlexW2269626665MaRDI QIDQ259729FDOQ259729

Authors: Alexander Wires 

Publication date: 18 March 2016

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-015-0295-4

Recommendations

• Definability in the substructure ordering of finite directed graphs
• Definability in first-order theories of graph orderings
• Definability in first order theories of graph orderings
• Definability in the embeddability ordering of finite directed graphs
• Definability of recursive predicates in the induced subgraph order
• Definability in the embeddability ordering of finite directed graphs. II
• Definability in substructure orderings. I: Finite semilattices
• Definability in substructure orderings. II: Finite ordered sets
• Subgraphs and well‐quasi‐ordering
• scientific article; zbMATH DE number 4195916

zbMATH Keywords

first-order definabilityinduced subgraphsordered setuniversal classes

Mathematics Subject Classification ID

Partial orders, general (06A06) Model theory of finite structures (03C13) Graph theory (05C99)

Cites Work

• Definability in substructure orderings. I: Finite semilattices
• Definability in substructure orderings. IV: Finite lattices
• Definability in substructure orderings. III: Finite distributive lattices
• Planar graphs and poset dimension
• Definability in the lattice of equational theories of semigroups
• Undecidable theories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The lattice of equational theories. Part II: The lattice of full sets of terms
• Title not available (Why is that?)
• Definability in lattices of equational theoris
• The falsity of the reconstruction conjecture for tournaments
• Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem
• Title not available (Why is that?)
• The strong perfect graph theorem
• Definability in substructure orderings. II: Finite ordered sets

Cited In (16)

• The poset of graphs ordered by induced containment
• Definability in substructure orderings. I: Finite semilattices
• Definability in substructure orderings. II: Finite ordered sets
• Definability in substructure orderings. IV: Finite lattices
• Definability in first order theories of graph orderings
• Defining recursive predicates in graph orders
• Definability of recursive predicates in the induced subgraph order
• Definability in first-order theories of graph orderings
• On the automorphism group of the substructure ordering of finite directed graphs
• Definability in the embeddability ordering of finite directed graphs
• Definability in the embeddability ordering of finite directed graphs. II
• The subtrace order and counting first-order logic
• Definability in the substructure ordering of finite directed graphs
• Complexity in Young's lattice
• Well-Quasi Orders and Hierarchy Theory
• Forbidden induced subgraphs and the Łoś-Tarski theorem

This page was built for publication: Definability in the substructure ordering of simple graphs

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