Ramsey-type theorems

P. Erdős, A. Hajnal

Research output: Contribution to journalArticle

94 Citations (Scopus)

Abstract

In this paper we will consider Ramsey-type problems for finite graphs, r-partitions and hypergraphs. All these problems ask for the existence of large homogeneous (monochromatic) configurations of a certain kind under the condition that the size of the underlying set is large. As it is quite common in Ramsey theory, most of our results are not sharp and almost all of them lead to new problems which seem to be difficult. The problems we treat are only loosely connected. So we will state and explain them section by section.

Original languageEnglish
Pages (from-to)37-52
Number of pages16
JournalDiscrete Applied Mathematics
Volume25
Issue number1-2
DOIs
Publication statusPublished - 1989

Fingerprint

Theorem
Ramsey Theory
Finite Graph
Hypergraph
Partition
Configuration

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Ramsey-type theorems. / Erdős, P.; Hajnal, A.

In: Discrete Applied Mathematics, Vol. 25, No. 1-2, 1989, p. 37-52.

Research output: Contribution to journalArticle

Erdős, P. ; Hajnal, A. / Ramsey-type theorems. In: Discrete Applied Mathematics. 1989 ; Vol. 25, No. 1-2. pp. 37-52.
@article{a29a663cf20041d0a41999647fa7a18f,
title = "Ramsey-type theorems",
abstract = "In this paper we will consider Ramsey-type problems for finite graphs, r-partitions and hypergraphs. All these problems ask for the existence of large homogeneous (monochromatic) configurations of a certain kind under the condition that the size of the underlying set is large. As it is quite common in Ramsey theory, most of our results are not sharp and almost all of them lead to new problems which seem to be difficult. The problems we treat are only loosely connected. So we will state and explain them section by section.",
author = "P. Erdős and A. Hajnal",
year = "1989",
doi = "10.1016/0166-218X(89)90045-0",
language = "English",
volume = "25",
pages = "37--52",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - Ramsey-type theorems

AU - Erdős, P.

AU - Hajnal, A.

PY - 1989

Y1 - 1989

N2 - In this paper we will consider Ramsey-type problems for finite graphs, r-partitions and hypergraphs. All these problems ask for the existence of large homogeneous (monochromatic) configurations of a certain kind under the condition that the size of the underlying set is large. As it is quite common in Ramsey theory, most of our results are not sharp and almost all of them lead to new problems which seem to be difficult. The problems we treat are only loosely connected. So we will state and explain them section by section.

AB - In this paper we will consider Ramsey-type problems for finite graphs, r-partitions and hypergraphs. All these problems ask for the existence of large homogeneous (monochromatic) configurations of a certain kind under the condition that the size of the underlying set is large. As it is quite common in Ramsey theory, most of our results are not sharp and almost all of them lead to new problems which seem to be difficult. The problems we treat are only loosely connected. So we will state and explain them section by section.

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

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

U2 - 10.1016/0166-218X(89)90045-0

DO - 10.1016/0166-218X(89)90045-0

M3 - Article

AN - SCOPUS:0013549418

VL - 25

SP - 37

EP - 52

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 1-2

ER -