Author/Authors :
Paul Erdos and Janos Suranyi، نويسنده , , Talmage James Reid، نويسنده , , Richard Schelp، نويسنده , , William Staton، نويسنده ,
Abstract :
Graphs with n + k vertices in which every set of n + j vertices induce a subgraph of maximum degree at least n are considered. For j = 1 and for k fairly small compared to n, we determine the minimum number of edges in such graphs.
