Back
Add Comment
Topics
Vote
Results
graph removal lemma
lemma 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
--Agreed Upon Solutions

The discussion does not exist would you like to add the first comment?

anonymous