Frankl–Rödl graph

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Notion

Domain

Beliefs and thought

In collections

Nobody has pulled it yet.

What Wikipedia says

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.

Excerpt from the Wikipedia article “Frankl–Rödl graph”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Tomruen File:Compound of two tetrahedra.png, CC SA 1.0, via Wikimedia Commons.