Efficient testing of hypergraphs (extended abstract)

DOI10.1007/3-540-45465-9_87MaRDI QIDQ4737228zbMATH OpenFDO

Authors Yoshiharu Kohayakawa, B. Nagle, Vojtěch Rödl

Publication date 11 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23801017.htm

zbMATH Keywords

combinatorial property testinghypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Every Monotone 3‐Graph Property is Testable
• Linear equations, arithmetic progressions and hypergraph property testing
• Linear equations, arithmetic progressions and hypergraph property testing
• Testing hypergraph coloring
• Testing the independence number of hypergraphs

Cited in

(18)

• Linear equations, arithmetic progressions and hypergraph property testing
• Linear equations, arithmetic progressions and hypergraph property testing
• Testability and repair of hereditary hypergraph properties
• On computing the frequencies of induced subhypergraphs
• Every Monotone 3-Graph Property is Testable
• Hypergraph coloring and reconfigured RAM testing
• Testing hypergraph coloring
• Hereditary Properties of Triple Systems
• Test dense subgraphs in sparse uniform hypergraph
• Edge correlations in Random regular hypergraphs and applications to subgraph testing
• Testing the independence number of hypergraphs
• Every Monotone 3‐Graph Property is Testable
• Discrete and Computational Geometry
• Hyper resolution and equality axioms without function substitutions
• A characterization of testable hypergraph properties
• Hypergraph removal with polynomial bounds
• Note on the 3-graph counting Lemma
• Generalizations of the removal lemma

This page was built for publication: Efficient testing of hypergraphs (extended abstract)

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