The Complexity of Defining a Relation on a Finite Graph (Q3778739)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4039881
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Defining a Relation on a Finite Graph |
scientific article; zbMATH DE number 4039881 |
Statements
The Complexity of Defining a Relation on a Finite Graph (English)
0 references
1987
0 references
definability of relations on finite graphs by short formulas
0 references
quantifier rank
0 references
3-regular asymmetric graphs
0 references
0.8131104707717896
0 references
0.8007157444953918
0 references
0.7916160225868225
0 references
0.7879577875137329
0 references
0.7769753336906433
0 references
