Jul 2026
Testing the Independent Set Property in Hypergraphs
This work proves a new upper bound of $\widetilde{O}\!\left(\frac{q\rho^{2q-3}}{\varepsilon^2 (q-2)!^2}\right)$ on the sample complexity of testing the $\rho$-independent set property.
Elena Grigorescu, Shreya Nasa, Cameron Seth
· arXiv.org · 1 citation