Keywords

#graph_removal_lemma

Graph removal lemma

In graph theory, the graph removal lemma states that when a graph contains few copies of a given subgraph, then all of the copies can be eliminated by removing a small number of edges. The special case in which the subgraph is a triangle is known as the triangle removal lemma.

Wed 27th

Provided by Wikipedia

Learn More

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

Graph removal lemma Szemerédi regularity lemma Hypergraph removal lemma Property testing Extremal graph theory Handshaking lemma Tetration Counting lemma Eulerian path Roth's theorem on arithmetic progressions
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.