More results on Ramsey-Turán type problems

P. Erdős, A. Hajnal, Vera T. Sós, E. Szemerédi

Research output: Contribution to journalArticle

30 Citations (Scopus)

Abstract

The paper deals with common generalizations of classical results of Ramsey and Turán. The following is one of the main results. Assume k≧2, ε>0, G n is a sequence of graphs of n-vertices and at least 1/2((3 k-5) / (3 k-2)+ε)n 2 edges, and the size of the largest independent set in G n is o(n). Let H be any graph of arboricity at most k. Then there exists an n 0 such that all G n with n>n 0 contain a copy of H. This result is best possible in case H=K 2 k .

Original languageEnglish
Pages (from-to)69-81
Number of pages13
JournalCombinatorica
Volume3
Issue number1
DOIs
Publication statusPublished - Mar 1983

Fingerprint

Arboricity
Graph in graph theory
Independent Set
Large Set
Generalization

Keywords

  • AMS subject classification (1980): 05C55, 05C35

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Mathematics(all)

Cite this

More results on Ramsey-Turán type problems. / Erdős, P.; Hajnal, A.; Sós, Vera T.; Szemerédi, E.

In: Combinatorica, Vol. 3, No. 1, 03.1983, p. 69-81.

Research output: Contribution to journalArticle

Erdős, P. ; Hajnal, A. ; Sós, Vera T. ; Szemerédi, E. / More results on Ramsey-Turán type problems. In: Combinatorica. 1983 ; Vol. 3, No. 1. pp. 69-81.
@article{a8e396c4ee8e4fc699c58a8ab22fde5f,
title = "More results on Ramsey-Tur{\'a}n type problems",
abstract = "The paper deals with common generalizations of classical results of Ramsey and Tur{\'a}n. The following is one of the main results. Assume k≧2, ε>0, G n is a sequence of graphs of n-vertices and at least 1/2((3 k-5) / (3 k-2)+ε)n 2 edges, and the size of the largest independent set in G n is o(n). Let H be any graph of arboricity at most k. Then there exists an n 0 such that all G n with n>n 0 contain a copy of H. This result is best possible in case H=K 2 k .",
keywords = "AMS subject classification (1980): 05C55, 05C35",
author = "P. Erdős and A. Hajnal and S{\'o}s, {Vera T.} and E. Szemer{\'e}di",
year = "1983",
month = "3",
doi = "10.1007/BF02579342",
language = "English",
volume = "3",
pages = "69--81",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
number = "1",

}

TY - JOUR

T1 - More results on Ramsey-Turán type problems

AU - Erdős, P.

AU - Hajnal, A.

AU - Sós, Vera T.

AU - Szemerédi, E.

PY - 1983/3

Y1 - 1983/3

N2 - The paper deals with common generalizations of classical results of Ramsey and Turán. The following is one of the main results. Assume k≧2, ε>0, G n is a sequence of graphs of n-vertices and at least 1/2((3 k-5) / (3 k-2)+ε)n 2 edges, and the size of the largest independent set in G n is o(n). Let H be any graph of arboricity at most k. Then there exists an n 0 such that all G n with n>n 0 contain a copy of H. This result is best possible in case H=K 2 k .

AB - The paper deals with common generalizations of classical results of Ramsey and Turán. The following is one of the main results. Assume k≧2, ε>0, G n is a sequence of graphs of n-vertices and at least 1/2((3 k-5) / (3 k-2)+ε)n 2 edges, and the size of the largest independent set in G n is o(n). Let H be any graph of arboricity at most k. Then there exists an n 0 such that all G n with n>n 0 contain a copy of H. This result is best possible in case H=K 2 k .

KW - AMS subject classification (1980): 05C55, 05C35

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

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

U2 - 10.1007/BF02579342

DO - 10.1007/BF02579342

M3 - Article

VL - 3

SP - 69

EP - 81

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 1

ER -