Finding Folkman Numbers via MAX CUT Problem

13 years 4 months ago

Download www.math.cmu.edu

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

Real-time Traffic

ENDM 2008 | K4 Free Graph | Monochromatic Triangle | Smallest Integer |

claim paper

» An Approximate MaxSteinerTreePacking MinSteinerCut Theorem

» Semidefinite programming based approaches to the break minimization problem

» Fixing MaxProduct Convergent Message Passing Algorithms for MAP LPRelaxations

» New Inference Rules for MaxSAT

» Free Bits PCPs and NonApproximability Towards Tight Results

» Efficient Maximum Margin Clustering via Cutting Plane Algorithm

» Free Bits PCPs and NonapproximabilityTowards Tight Results

» Mining discrete patterns via binary matrix factorization

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	ENDM
Authors	Andrzej Dudek, Vojtech Rödl

Comments (0)

Sciweavers

Finding Folkman Numbers via MAX CUT Problem

ENDM 2008 | K4 Free Graph | Monochromatic Triangle | Smallest Integer |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers

Sciweavers

Finding Folkman Numbers via MAX CUT Problem

ENDM 2008 | K4­ Free Graph | Monochromatic Triangle | Smallest Integer |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers

ENDM 2008 | K4 Free Graph | Monochromatic Triangle | Smallest Integer |