Sciweavers

ENDM
2008

Finding Folkman Numbers via MAX CUT Problem

14 years 16 days ago
Finding Folkman Numbers via MAX CUT Problem
In this note we report on our recent work, still in progress, regarding Folkman numbers. Let f(2, 3, 4) denote the smallest integer n such that there exists a K4
Andrzej Dudek, Vojtech Rödl
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where ENDM
Authors Andrzej Dudek, Vojtech Rödl
Comments (0)