An example of a 16-vertex Folkman edge (3,4)-graph without 8-cliques
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.