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

Simple item page
dc.creatorKolev, N.
dc.creatorNenov, N.
dc.date2006-02-12
dc.date.accessioned2026-07-07T07:03:20Z
dc.date.available2026-07-07T07:03:20Z
dc.descriptionIn this paper we prove a new upper bouhd on an edge Folkman number. In a previous paper we have proved that this bound is exact.
dc.identifierhttps://arxiv.org/abs/math/0602249
dc.identifierhttp://arxiv.org/abs/math/0602249
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/108933
dc.subjectCombinatorics
dc.subject05C55
dc.titleAn example of a 16-vertex Folkman edge (3,4)-graph without 8-cliques
dc.typetext

Files

Collections

arXiv