On restricted colourings of \(K_ n\) (Q793052): Difference between revisions

Given a graph H and suppose that edges of \(K_ n\) are coloured by r colours, which colourings of the subgraphs of \(K_ n\), isomorphic to H, must and which ones can occur? These types of problems, that include the Ramsey theory, are studied in this paper. The anti-Ramsey numbers for paths are determined. A theorem concerning the possible sets of numbers of colours of subgraphs isomorphic to \(H=K_ 3\), under several restrictions on r, is proved.