Abstract

A sum-free r-partition of a group of order n induces an edge-colouring of Kn, the complete graph on n vertices, in r colours without monochromatic triangles. However, there exist such r-colourings (known as proper colourings) which cannot be induced by a sum-free r-partition of any group of order n.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call