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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient testing of large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every monotone graph property is testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with small subgraphs of large chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Partitions of Hypergraphs: Regularity Lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank

Latest revision as of 20:09, 25 June 2024