Extremal triangle-free and odd-cycle-free colourings of uncountable graphs

Chris Lambie-Hanson, Dániel T. Soukup

The optimality of the Erdős-Rado theorem for pairs is witnessed by the colouring ${\Delta }_{\kappa }:[2^{\kappa }{]}^2\to \kappa$ recording the least point of disagreement between two functions. This…