The Induced Removal Lemma in Sparse Graphs (Q5222577): Difference between revisions

@@ Property / cites work @@
+The Algorithmic Aspects of the Regularity Lemma
@@ Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient testing of large graphs
@@ Property / cites work: Efficient testing of large graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for graph regularity and removal lemmas
@@ Property / cites work: Bounds for graph regularity and removal lemmas / rank @@
+Normal rank
@@ Property / cites work @@
+Graph removal lemmas
@@ Property / cites work: Graph removal lemmas / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
+Normal rank
@@ Property / cites work @@
+The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
+Normal rank
@@ Property / cites work @@
+A new proof of the graph removal lemma
@@ Property / cites work: A new proof of the graph removal lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds of tower type for Szemerédi's uniformity lemma
+Normal rank
@@ Property / cites work @@
+A sparse regular approximation lemma
@@ Property / cites work: A sparse regular approximation lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Q4175585
@@ Property / cites work: Q4175585 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4200109
@@ Property / cites work: Q4200109 / rank @@
+Normal rank