| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5778186 | Annals of Pure and Applied Logic | 2017 | 18 Pages |
Abstract
Let (Hn,E) denote the Henson graph, the unique countable homogeneous graph whose age consists of all finite Kn-free graphs. In this note the reducts of the Henson graphs with a constant are determined up to first-order interdefinability. It is shown that up to first-order interdefinability (H3,E,0) has 13 reducts and (Hn,E,0) has 16 reducts for nâ¥4.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
András Pongrácz,