A note on the testability of Ramsey's class

DOI10.1007/978-3-642-13562-0_27zbMATH Open1284.68649OpenAlexW2161803520MaRDI QIDQ3569084FDOQ3569084

Authors: Charles Jordan, Thomas Zeugmann 

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13562-0_27

Recommendations

• Testable and untestable classes of first-order formulae
• Relational Properties Expressible with One Universal Quantifier Are Testable
• scientific article; zbMATH DE number 1754615
• Efficient testing of large graphs
• Testing graphs for colorability properties*

zbMATH Keywords

logicproperty testingRamsey's class

Mathematics Subject Classification ID

Randomized algorithms (68W20) Generalized Ramsey theory (05C55) Hypergraphs (05C65)

Cited In (5)

• Relational Properties Expressible with One Universal Quantifier Are Testable
• The Ramsey test revisited*
• Testable and untestable classes of first-order formulae
• A Note on $\mathcal{D}_{n}$-Testability for Varieties of Bands
• A simple and non-trivial Ramsey test

This page was built for publication: A note on the testability of Ramsey's class

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