Ramsey theory over partitions II: Negative Ramsey relations and pump-up theorems
Menachem Kojman, Assaf Rinot, Juris Steprans

TL;DR
This paper advances the understanding of anti-Ramsey relations over partitions by demonstrating how strong colorings can be extended and improved, generalizing classical pump-up theorems in Ramsey theory.
Contribution
It proves that strong colorings over partitions can be extended to larger color sets and provides conditions to upgrade certain colorings, generalizing existing pump-up theorems.
Findings
Strong colorings can be stretched to larger color sets over partitions.
Conditions are identified for upgrading from $Pr_1$ to $Pr_0$ colorings.
Results generalize classical pump-up theorems to partitioned settings.
Abstract
In this series of papers we advance Ramsey theory of colorings over partitions. In this part, we concentrate on anti-Ramsey relations, or, as they are better known, strong colorings, and in particular solve two problems from [CKS21]. It is shown that for every infinite cardinal , a strong coloring on by colors over a partition can be stretched to one with colors over the same partition. Also, a sufficient condition is given for when a strong coloring witnessing over a partition may be improved to witness . Since the classical theory corresponds to the special case of a partition with just one cell, the two results generalize pump-up theorems due to Eisworth and Shelah, respectively.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Mathematical and Theoretical Analysis
