What can we hope to accomplish in generalized Ramsey theory ?
type: Item
instance of: scholarly article
title: What can we hope to accomplish in generalized Ramsey theory ?
zbMATH Open document ID: 0628.05048
DOI: 10.1016/0012-365X(87)90172-5
published in: Discrete Mathematics
publication date: 1987-01-01T00:00:00Z
review text: Let F, G, and H denote graphs. We write \(F\to (G,H)\) to mean that, however the edges of F are colored red and blue, either the red subgraph of F contains a copy of G or the blue subgraph of F contains a copy of H. We write \(r(G,H)=t\) if \(K_ t\to (G,H)\) but \(K_{t-1}\nrightarrow (G,H)\); r(G,H) is called the Ramsey number of G and H. In this paper, the author discusses many of the major results and conjectures about Ramsey numbers and the arrow relations. He also discusses possible directions for new research in this area and adds several conjectures of his own.
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05-02
zbMATH DE Number: 4021188
zbMATH Keywords: Ramsey number
author: Stefan A. Burr
reviewed by: Jack E. Graver
MaRDI profile type: Publication
cites work: A note on Ramsey numbers
cites work: Q3852212
cites work: Q4044602
cites work: Q3937444
cites work: Ramsey Numbers Involving Graphs with Long Suspended Paths
cites work: Q3337503
cites work: Q3684154
cites work: Q3201758
cites work: On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
cites work: Q4075489
cites work: Generalized Ramsey Numbers Involving Subdivision Graphs, And Related Problems in Graph Theory
cites work: Generalizations of a Ramsey-theoretic result of chvátal
cites work: Ramsey-minimal graphs for star-forests
cites work: Ramsey-minimal graphs for forests
cites work: Q3688425
cites work: Q3825106
cites work: Goodness of trees for generalized books
cites work: Q3869383
cites work: Ramsey Theorems for Multiple Copies of Graphs
cites work: On graphs with Ramsey-infinite blocks
cites work: Ramsey numbers of graphs with long tails
cites work: Q4120601
cites work: The Ramsey number of a graph with bounded maximum degree
cites work: Graph Theory and Probability. II
cites work: Q4198056
cites work: Q3903002
cites work: Generalized Ramsey theory for graphs, X: Double stars
cites work: Parallel concepts in graph theory
cites work: Q5659565
cites work: Ramsey numbers for quadrangles and triangles
cites work: Q4168641
cites work: The structure of critical Ramsey graphs
cites work: Q3338254
full work available at URL: 0012-365x(87)90172-5
OpenAlex ID: W2008078085
description: scientific article; zbMATH DE number 4021188