Colors of the Pseudotree
Abstract
We investigate big Ramsey degrees of finite substructures of the universal countable homogeneous meet-tree and its binary variant. We prove that structures containing antichains have infinite big Ramsey degrees, and the big Ramsey degree of a 2-element chain is at least 8 and 7 for the binary variant. We deduce that the generic C-relation does not have finite big Ramsey degrees.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.