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.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics