Extremal triangle-free and odd-cycle-free colourings of uncountable graphs (Q2036604)

The optimality of the Erdős-Rado theorem for pairs is witnessed by some colouring function. Questions when such function is an extremal or odd-cycle-free colouring are investigated. Also the question as to whether such function has the minimal cardinality of any maximal triangle-free or odd-cycle-free colouring is considered.