covering a graph with subgraphs of certain type has a long history in graph theory and it goes back to boole, ore and m.hall. the problem of covering a graph by cliques or bicliques has been studied by many researchers including erdos, goodman, posa, chung, graham, pollak, alon etc. few of the results obtained for graphs extend to hypergraphs. in this talk, i will present some of these results and show some new results regarding the covers of an $r$-uniform hypergraph by $k$-cuts such that the total size of the cuts (the sum of the number of edges of all cuts) is minimum. this is joint work with andr$\rm\acute e$ k$\rm\ddot u$ndgen (cal.state san marcos).