Frankl–RÖDl Graph


Logo of Frankl–Rödl graph
Link to Dbpedia

What is Frankl–Rödl graph?

In graph theory and computational complexity theory, a Frankl–Rödl graph is a graph defined by connecting pairs of vertices of a hypercube that are at a specified even distance from each other. The graphs of this type are parameterized by the dimension of the hypercube and by the distance between adjacent vertices. Frankl–Rödl graphs are named after Péter Frankl and Vojtěch Rödl, who proved in 1987 that (for certain ranges of the graph parameters) they have small independence number and high chromatic number. They have since become of interest to computational complexity theorists, as difficult examples for semidefinite programming based approximation algorithms for the vertex cover and graph coloring problems. Their properties with respect to these algorithms have been used to call into question the unique games conjecture.

Technology Types

graphparametric families of graphregular graph


Frankl-Rödl graph

Tech Info

Source: [object Object]
 — Date merged: 11/6/2021, 1:32:42 PM
 — Date scraped: 5/20/2021, 5:51:46 PM