On unavoidable graphs

F. R K Chung, P. Erdős

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

How many edges can be in a graph which is forced to be contained in every graph on n vertices and e edges? In this paper we obtain bounds which are in many cases asymptotically best possible.

Original languageEnglish
Pages (from-to)167-176
Number of pages10
JournalCombinatorica
Volume3
Issue number2
DOIs
Publication statusPublished - Jun 1983

Fingerprint

Graph in graph theory

Keywords

  • AMS subject classification (1980): 05C35

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Mathematics(all)

Cite this

On unavoidable graphs. / Chung, F. R K; Erdős, P.

In: Combinatorica, Vol. 3, No. 2, 06.1983, p. 167-176.

Research output: Contribution to journalArticle

Chung, F. R K ; Erdős, P. / On unavoidable graphs. In: Combinatorica. 1983 ; Vol. 3, No. 2. pp. 167-176.
@article{41db701b80f74987bc12f5fe2de67c7d,
title = "On unavoidable graphs",
abstract = "How many edges can be in a graph which is forced to be contained in every graph on n vertices and e edges? In this paper we obtain bounds which are in many cases asymptotically best possible.",
keywords = "AMS subject classification (1980): 05C35",
author = "Chung, {F. R K} and P. Erdős",
year = "1983",
month = "6",
doi = "10.1007/BF02579290",
language = "English",
volume = "3",
pages = "167--176",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
number = "2",

}

TY - JOUR

T1 - On unavoidable graphs

AU - Chung, F. R K

AU - Erdős, P.

PY - 1983/6

Y1 - 1983/6

N2 - How many edges can be in a graph which is forced to be contained in every graph on n vertices and e edges? In this paper we obtain bounds which are in many cases asymptotically best possible.

AB - How many edges can be in a graph which is forced to be contained in every graph on n vertices and e edges? In this paper we obtain bounds which are in many cases asymptotically best possible.

KW - AMS subject classification (1980): 05C35

UR - http://www.scopus.com/inward/record.url?scp=51249180051&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51249180051&partnerID=8YFLogxK

U2 - 10.1007/BF02579290

DO - 10.1007/BF02579290

M3 - Article

AN - SCOPUS:51249180051

VL - 3

SP - 167

EP - 176

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 2

ER -