Testing the independence number of hypergraphs

DOI10.1007/978-3-540-27821-4_36MaRDI QIDQ5313043zbMATH OpenOpenAlexFDO

Authors Michael Langberg

Publication date 25 August 2005

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

Full work available at URL https://doi.org/10.1007/b99805

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Recommendations

• Testing hypergraph coloring
• Testing hypergraph colorability
• Efficient testing of hypergraphs (extended abstract)
• Linear equations, arithmetic progressions and hypergraph property testing
• Linear equations, arithmetic progressions and hypergraph property testing

Cited in

(3)

• Testing hypergraph colorability
• Testing hypergraph coloring
• Efficient testing of hypergraphs (extended abstract)

This page was built for publication: Testing the independence number of hypergraphs

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