Remarks on the distribution of colors in Gallai colorings (Q785792)

A Gallai colouring of a complete graph \(K_{n}\) is an edge colouring where there is no triangle coloured with three different colours. The paper [\textit{A. Gyárfás} et al., Eur. J. Comb. 86, Article ID 103087, 8 p. (2020; Zbl 1437.05072)] proved that, for any integer \(k\ge 3\), there is a unique integer \(g(k)\) such that \(n\ge g(k)\) if and only if there exists a Gallai-colouring of \(K_{n}\) with \(e_{i}\) edges in colour \(i\) for every \(e_{1}\le \cdots\le e_{k}\) satisfying \(\sum_{i=1}^{k}e_{i}=\binom{n}{2}\). The paper [loc. cit.] also provided lower and upper bounds for \(g(k)\). The current paper improves the upper and lower bounds for \(g(k)\) and shows that \(g(5) = 10\).