Title of article
Sizes of graphs with induced subgraphs of large maximum degree
Author/Authors
Paul Erdos and Janos Suranyi، نويسنده , , Talmage James Reid، نويسنده , , Richard Schelp، نويسنده , , William Staton، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
4
From page
283
To page
286
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.
Journal title
Discrete Mathematics
Serial Year
1996
Journal title
Discrete Mathematics
Record number
943961
Link To Document