Nearly uniform distribution of edges among k‐subgraphs of a graph

Jozef Širáň, Z. Tuza

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)591-604
Number of pages14
JournalJournal of Graph Theory
Volume16
Issue number6
DOIs
Publication statusPublished - 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