Topology, forcing, and graph colourings
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911571856326656 |
|---|---|
| author | Greenberg, Noam Lecomte, Dominique Turetsky, Dan Zelen, Miroslav |
| author_facet | Greenberg, Noam Lecomte, Dominique Turetsky, Dan Zelen, Miroslav |
| contents | We introduce a family of forcing notions that are helpful in showing that certain graphs do not have countable colourings of (additive) Borel class alpha. We construct graphs that are ''weakly minimal'' for such colourings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_05554 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Topology, forcing, and graph colourings Greenberg, Noam Lecomte, Dominique Turetsky, Dan Zelen, Miroslav General Topology Logic We introduce a family of forcing notions that are helpful in showing that certain graphs do not have countable colourings of (additive) Borel class alpha. We construct graphs that are ''weakly minimal'' for such colourings. |
| title | Topology, forcing, and graph colourings |
| topic | General Topology Logic |
| url | https://arxiv.org/abs/2604.05554 |