### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 591-604 |

Number of pages | 14 |

Journal | Journal of Graph Theory |

Volume | 16 |

Issue number | 6 |

DOIs | |

Publication status | Published - 1992 |

### ASJC Scopus subject areas

- Geometry and Topology

## Fingerprint Dive into the research topics of 'Nearly uniform distribution of edges among k‐subgraphs of a graph'. Together they form a unique fingerprint.

## Cite this

Širáň, J., & Tuza, Z. (1992). Nearly uniform distribution of edges among k‐subgraphs of a graph.

*Journal of Graph Theory*,*16*(6), 591-604. https://doi.org/10.1002/jgt.3190160606