@inbook{9a60852d9d234a22909446eec3878cca,

title = "Testing the independence number of hypergraphs",

abstract = "A k-uniform hypergraph G of size n is said to be ε-far from having an independent set of size pn if one must remove at least εnk edges of G in order for the remaining hypergraph to have an independent set of size pn. In this work, we present a natural property testing algorithm that distinguishes between hypergraphs which have an independent set of size ≥ pn and hypergraphs which are ε-far from having an independent set of size pn. Our algorithm is natural in the sense that we sample ≃ c(k) ρ2k/ε3random vertices of G, and according to the independence number of the hypergraph induced by this sample, we distinguish between the two cases above. Here c(k) depends on k alone (e.g. the sample size is independent of n). To the best of our knowledge, property testing of the independence number of hypergraphs has not been addressed in the past.",

author = "Michael Langberg",

note = "Copyright: Copyright 2020 Elsevier B.V., All rights reserved.",

year = "2004",

doi = "10.1007/978-3-540-27821-4_36",

language = "אנגלית",

isbn = "3540228942",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "405--416",

editor = "Klaus Jansen and Sanjeev Khanna and Rolim, {Jose D. P.} and Dana Ron",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "גרמניה",

}