Definability in the substructure ordering of simple graphs (Q259729)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Definability in the substructure ordering of simple graphs |
scientific article; zbMATH DE number 6558156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Definability in the substructure ordering of simple graphs |
scientific article; zbMATH DE number 6558156 |
Statements
Definability in the substructure ordering of simple graphs (English)
0 references
18 March 2016
0 references
first-order definability
0 references
induced subgraphs
0 references
ordered set
0 references
universal classes
0 references
0.9665851
0 references
0.9316784
0 references
0.92976534
0 references
0.9173031
0 references
0.90353227
0 references
0.9017207
0 references
0.89406717
0 references
0.88792896
0 references
0 references
