Hypergraph removal lemma
id:
hypergraph-removal-lemma-165-4707770
title:
Hypergraph removal lemma
text:
In graph theory, the hypergraph removal lemma states that when a hypergraph contains few copies of a given sub-hypergraph, then all of the copies can be eliminated by removing a small number of hyperedges. It is a generalization of the graph removal lemma. The special case in which the graph is a tetrahedron is known as the tetrahedron removal lemma. It was first proved by Nagle, Rödl, Schacht and Skokan and, independently, by Gowers. The hypergraph removal lemma can be used to prove results suc
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Hypergraph_removal_lemma
date created:
2019-11-21T00:33:32Z
date modified:
2024-08-29T10:01:08Z
main entity:
{"identifier":"Q85767876","url":"https://www.wikidata.org/entity/Q85767876"}
image:
fields total:
13
integrity:
14