scientific article; zbMATH DE number 5485484

MaRDI QIDQ3549648zbMATH OpenFDO

Authors Vojtěch Rödl, M. Schacht

Publication date 5 January 2009

zbMATH Keywords

hereditary graph propertieshypergraphsproperty testersrandomized algorithmsremoval lemmatestability

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Cited in

(10)

• Induced arithmetic removal: complexity 1 patterns over finite fields
• Additive combinatorics: with a view towards computer science and cryptography -- an exposition
• Indistinguishability and First-Order Logic
• Relational Properties Expressible with One Universal Quantifier Are Testable
• Testing Linear-Invariant Properties
• Edge correlations in Random regular hypergraphs and applications to subgraph testing
• A geometric theory for hypergraph matching
• A characterization of testable hypergraph properties
• The codegree Turán density of tight cycles
• On the stability of the Erdős-Ko-Rado theorem

This page was built for publication:

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