# Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs

```@inproceedings{Khot2014HardnessOF,
title={Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs},
author={Subhash Khot and Rishi Saket},
booktitle={SODA},
year={2014}
}```
This work studies the hardness of finding independent sets in hypergraphs which are either 2colorable or arealmost2-colorable, i.e. can be2-colored after removing a small fraction of vertices and the incident hyperedges. To be precise, say that a hyperg ra h is(1−ε)-almost2-colorable if removing anε fraction of its vertices and all hyperedges incident on them makes the remaining hypergraph 2-colorable. In particular we prove the following results. • For an arbitrarily small constant γ > 0… CONTINUE READING

11 Citations
11 References
Similar Papers

#### Citations

##### Publications citing this paper.
Showing 1-10 of 11 extracted citations

#### References

##### Publications referenced by this paper.
Showing 1-10 of 11 references