Author:
Street Anne Penfold,Wallis W. D.
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.
Publisher
Cambridge University Press (CUP)
Reference9 articles.
1. On the ramsey numbers N(3,3,…3;2)
2. Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices
3. On triangular and cyclic ramsey numbers with k colors
4. Jon Folkman (1967), ‘Notes on the Ramsey number N(3,3,3,3)’, Manuscript, Rand Corp., Santa Monica.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Isomorphic factorisations VI: Automorphisms;Lecture Notes in Mathematics;1979
2. Proper colourings of K15;Journal of the Australian Mathematical Society;1977-12
3. Embedding proper colourings;Combinatorial Mathematics IV;1976
4. A non-imbeddable proper colouring;Combinatorial Mathematics IV;1976