Every Monotone 3-Graph Property is Testable (Q3439395): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2005.06.086
+Normal rank
@@ Property / OpenAlex ID @@
+W2072500969
@@ Property / OpenAlex ID: W2072500969 / rank @@
+Normal rank
@@ 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 @@
+Every monotone graph property is testable
@@ Property / cites work: Every monotone graph property is testable / rank @@
+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 @@
+Property testing and its connection to learning and approximation
+Normal rank
@@ Property / cites work @@
+Q4737228
@@ Property / cites work: Q4737228 / rank @@
+Normal rank
@@ Property / cites work @@
+On graphs with small subgraphs of large chromatic number
+Normal rank
@@ Property / cites work @@
+Regular Partitions of Hypergraphs: Regularity Lemmas
+Normal rank
@@ Property / cites work @@
+Robust Characterizations of Polynomials with Applications to Program Testing
+Normal rank