Extreme degrees in random graphs

Let G* be a simple undirected graph on n labeled vertices. A general approach to the investigation of the probability distribution of extreme degrees in a random subgraph of G* is given. As an example of the application of the method, we consider the case when G* is a complete bipartite graph.