We investigate the behavior of the function f = f(n, k, e) defined as the smallest integer with the following property: If in a graph on n vertices, the numbers of edges in any two induced subgraphs on k vertices differ by at most e, then the graph or its complement has at most f edges. One of the results states that (Formula Presented.) . © 1929 John Wiley & Sons, Inc.
ASJC Scopus subject areas
- Geometry and Topology