2000 character limit reached
On a problem of Erdos and Hajnal
Published 23 Feb 2025 in math.LO and math.CO | (2502.16625v1)
Abstract: Addressing a question of Erdos and Hajnal we show that one can force a graph with no large independent sets and no monochromatic triples as successors of strong limit singular cardinals, even without assuming GCH. The result can be pushed down to .
Paper Prompts
Sign up for free to create and run prompts on this paper.