5 papers
The finite big Ramsey degrees of Henson graphs are provable in
Peter Cholak, Natasha Dobrinen, Henry Towsner
Let denote a computable copy of the -clique free universal homogeneous Henson graph, denote a finite subgraph of , and deno…
The Henson graphs: colorings and codings
Peter Cholak, Natasha Dobrinen, Charlie McCoy
By recent work of \citet{DobrinenICM} and \citet{Balko7} we know that every finite in the Henson graph (the universal ultrahomogeneous -clique free gr…
Big Ramsey degrees and the two-branching pseudotree
David Chodounský, David Chodounský, Natasha Dobrinen +1
We prove that each finite chain in the two-branching countable ultrahomogeneous pseudotree has finite big Ramsey degrees. This is in contrast to the recent result of Chodounský, Es…
Tukey-idempotency and strong p-points
Tom Benhamou, Natasha Dobrinen, Tan Ãzalp
We characterize strong -point ultrafilters by showing that they are exactly those -points that are not Tukey above ; or equivalently, those -points that are…
On the Tukey types of Fubini products
Tom Benhamou, Natasha Dobrinen
We extend the class of ultrafilters over countable sets for which , extending several results from \cite{Dobrinen/Todorcevic11}. In particular, we prove tha…