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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In 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.

Keywords

Combinatorics, 05C55

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/108933

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0602249
 http://arxiv.org/abs/math/0602249

Collections

arXiv