Every Monotone 3‐Graph Property is Testable
From MaRDI portal
Publication:5454263
DOI10.1137/060652294zbMath1142.68053OpenAlexW2080767775MaRDI QIDQ5454263
Mathias Schacht, Vojtěch Rödl, Christian Avart
Publication date: 28 March 2008
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060652294
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)
Related Items
On 3‐graphs with no four vertices spanning exactly two edges ⋮ Testing Euclidean Spanners ⋮ Generalizations of the removal lemma ⋮ Testability and repair of hereditary hypergraph properties