Rainbow numbers for graphs with cyclomatic number at most two

Ingo Schiermeyer, Roman Sotak

For a given graph H and n ? 1; let f(n;H) denote the maximum number m for which it is possible to colour the edges of the complete graph Kn with m colours in such a way that each s…