Article thumbnail

Three color Ramsey number of K4 − e

By Geoffrey Exoo


AbstractWe show that 28⩽r(K4−e;3)⩽32. The construction used to establish the lower bound is made by using the strongly regular Schläfli graph for one of the colors, and then by partitioning its complement into two isomorphic graphs. The coloring has the property that each edge is on exactly one monochromatic K3, hence the vertex sets of these K3's form a Steiner triple system

Publisher: Published by Elsevier B.V.
Year: 1991
DOI identifier: 10.1016/0012-365X(91)90122-I
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • https://s3-eu-west-1.amazonaws... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.