English

Hajnal--M\'{a}t\'{e} graphs, Cohen reals, and disjoint type guessing

Logic 2023-12-05 v1 Combinatorics

Abstract

A Hajnal--M\'{a}t\'{e} graph is an uncountably chromatic graph on ω1\omega_1 satisfying a certain natural sparseness condition. We investigate Hajnal-M\'{a}t\'{e} graphs and generalizations thereof, focusing on the existence of Hajnal-M\'{a}t\'{e} graphs in models resulting from adding a single Cohen real. In particular, answering a question of D\'{a}niel Soukup, we show that such models necessarily contain triangle-free Hajnal-M\'{a}t\'{e} graphs. In the process, we isolate a weakening of club guessing called \emph{disjoint type guessing} that we feel is of interest in its own right. We show that disjoint type guessing is independent of ZFC\mathsf{ZFC} and, if disjoint type guessing holds in the ground model, then the forcing extension by a single Cohen real contains Hajnal-M\'{a}t\'{e} graphs GG such that the chromatic numbers of finite subgraphs of GG grow arbitrarily slowly.

Keywords

Cite

@article{arxiv.2312.01828,
  title  = {Hajnal--M\'{a}t\'{e} graphs, Cohen reals, and disjoint type guessing},
  author = {Chris Lambie-Hanson and Dávid Uhrik},
  journal= {arXiv preprint arXiv:2312.01828},
  year   = {2023}
}

Comments

16 pages