Definability in the Embeddability Ordering of Finite Directed Graphs, II
Sign Up to like & getrecommendations! Published in 2019 at "Order"
DOI: 10.1007/s11083-018-9467-2
Abstract: We deal with first-order definability in the embeddability ordering (D;≤)$(\mathscr{D}; \leq )$ of finite directed graphs. A directed graph G∈D$G\in \mathscr{D}$ is said to be embeddable into G′∈D$G^{\prime } \in \mathscr{D}$ if there exists an… read more here.
Keywords: order; first order; definability embeddability; finite directed ... See more keywords