Keywords

#hypergraph_removal_lemma

Hypergraph removal lemma

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.

Thu 29th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Hypergraph removal lemma Graph removal lemma Hypergraph regularity method Szemerédi regularity lemma Szemerédi's theorem Corners theorem Vojtěch Rödl Extremal graph theory Half graph Glossary of graph theory
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.