Every Monotone 3‐Graph Property is Testable

DOI10.1137/060652294MaRDI QIDQ5454263zbMATH OpenOpenAlexFDO

Authors Christian Avart, Vojtěch Rödl, M. Schacht

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

zbMATH Keywords

hypergraphhypergraph regularity lemmamonotone propertiesproperty testing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Recommendations

• Every Monotone Graph Property Is Testable
• Every monotone graph property is testable
• scientific article; zbMATH DE number 2086691
• Linear equations, arithmetic progressions and hypergraph property testing
• Linear equations, arithmetic progressions and hypergraph property testing

Cited in

(13)

• Testing hypergraph colorability
• Linear equations, arithmetic progressions and hypergraph property testing
• Linear equations, arithmetic progressions and hypergraph property testing
• Testability and repair of hereditary hypergraph properties
• Every monotone graph property is testable
• Every Monotone Graph Property Is Testable
• scientific article; zbMATH DE number 2086691 (Why is no real title available?)
• Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
• Testing Euclidean Spanners
• On 3‐graphs with no four vertices spanning exactly two edges
• Positive co-degree densities and jumps
• A characterization of testable hypergraph properties
• Generalizations of the removal lemma

This page was built for publication: Every Monotone 3‐Graph Property is Testable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5454263)