49 research outputs found
Anti-Ramsey numbers of small graphs
The anti-Ramsey number ), for a graph and an integer
, is defined to be the minimal integer such that in any
edge-colouring of by at least colours there is a multicoloured copy
of , namely, a copy of whose edges have distinct colours. In this paper
we determine the anti-Ramsey numbers of all graphs having at most four edges