Cameron Seth

works on

hypergraph containers 1 hypergraphs 1 independent set 1 property testing 1 sample complexity 1

From the 1 of 3 linked papers with an AI index.

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

Testing the Independent Set Property in Hypergraphs

Elena Grigorescu, Shreya Nasa, Cameron Seth

The paper presents a new upper bound on the sample complexity for testing whether a q‑uniform hypergraph has an independent set of size ρn, improving previous results by reducing t…

cs.DS2025

A Tolerant Independent Set Tester

Cameron Seth

We give nearly optimal bounds on the sample complexity of $(I^c ◯ (I^µ), I^µ)$ -tolerant testing the $I ¨ $ -independent set property in the dense graph setting. In particular, we g…