ABSTRACT
A hypergraph H consists of a vertex set V together with a family E of subsets of V, which are called the edges of H. A r-uniform hypergraph, or r-graph, for short, is a hypergraph whose edge set consists of r-subsets of V. A graph is just a special case of an r-graph with r = 2.
