An example of a 16-vertex Folkman edge (3,4)-graph without 8-cliques

TitleAn example of a 16-vertex Folkman edge (3,4)-graph without 8-cliques
Publication TypeJournal Article
Year of Publication2008
AuthorsKolev N, Nenov N
JournalAnnuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique
Volume98
KeywordsFolkman graph, Folkman number
Abstract

In [6] we computed the edge Folkman number $F(3,4;8)=16$. There we used and announced without proof that in any blue-red coloring of the edges of the graph $K_1+C_5+C_5+C_5$ there is either a blue 3-clique or red 4-clique. In this paper we give a detailed proof of this fact.

2000 MSC

05C55

AttachmentSize
PDF icon 98-127-141.pdf1.38 MB