Publications of (and about) Paul Erdös
Autor: Erdös, Paul; Luczak, Tomasz; Spencer, Joel
Title: Subgraphs of large minimal degree. (In English)
Source: Frieze, Alan (ed.) et al., Random graphs. Volume 2. Based on papers presented at the fourth international seminar on random graphs and probabilistic methods in combinatorics, held in Poznan, Poland, August 7-11, 1989. Chichester: Wiley, Wiley-Interscience Publication. 59-66 (1992).
Review: A graph G on n vertices is full if each vertex of G has at least \lceil(n- 1)/2\rceil neighbors. We study a behavior of the size of the largest full subgraph of G, denoted by f(G), when G is a (n,M) graph, that is, a graph with n vertices and M edges.
Classif.: * 05C80 Random graphs
Keywords: full subgraph; (n,M) graph
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag