Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2503.18727 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916765916725248 |
|---|---|
| author | Chodounský, David Eskew, Monroe Weinert, Thilo |
| author_facet | Chodounský, David Eskew, Monroe Weinert, Thilo |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_18727 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Colors of the Pseudotree Chodounský, David Eskew, Monroe Weinert, Thilo Combinatorics Logic 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. |
| title | Colors of the Pseudotree |
| topic | Combinatorics Logic |
| url | https://arxiv.org/abs/2503.18727 |