Abstract

Sum-free sets may be used to colour the edges of a complete graph in such a way as to avoid monochromatic triangles. We discuss the automorphism groups of such graphs. Embedding of colourings is considered. Finally we illustrate a way of constructing colourings using block designs.

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