\indent An $r$-graph is like a graph except that every edge contains $r$ vertices instead of two. We'll talk about how to find a large independent set in an $r$-graph, which means a set of vertices not containing any edge. Conversely, we'll also discuss how to generate a hypergraph where large independent sets do not exist. Some of research is joint with Jacques Verstraete.