\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.