Premium
On the Ramsey multiplicities of graphs—problems and recent results
Author(s) -
Burr Stefan A.,
Rosta Vera
Publication year - 1980
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190040403
Subject(s) - ramsey's theorem , combinatorics , mathematics , monochromatic color , graph , ramsey theory , graph coloring , discrete mathematics , botany , biology
Ramsey's theorem guarantees that if G is a graph, then any 2‐coloring of the edges of a large enough complete graph yields a monochromatic copy of G . Interesting problems arise when one asks how many such G must occur. A survey of this and related problems is given, along with a number of new results.