For |G| >= 2 in the Henson graph H_{n+1}, there exists a finite computable coloring of copies of G such that every isomorphic copy of H_{n+1} computes the (|G|-1)th jump of the empty set.
Theindivisibilityofthehomogeneous 𝐾𝑛-free graphs.Journal of Combinatorial Theory, Series B, 47(2):162–170
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Henson graphs: colorings and codings
For |G| >= 2 in the Henson graph H_{n+1}, there exists a finite computable coloring of copies of G such that every isomorphic copy of H_{n+1} computes the (|G|-1)th jump of the empty set.