Dependent random choice
id:
dependent-random-choice-288-13354241
title:
Dependent random choice
text:
In mathematics, dependent random choice is a probabilistic technique that shows how to find a large set of vertices in a dense graph such that every small subset of vertices has many common neighbors. It is a useful tool to embed a graph into another graph with many edges. Thus it has its application in extremal graph theory, additive combinatorics and Ramsey theory.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Dependent_random_choice
date created:
date modified:
2024-04-09T15:33:13Z
main entity:
{"identifier":"Q96376236","url":"https://www.wikidata.org/entity/Q96376236"}
image:
fields total:
13
integrity:
13