Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Burr et al. (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: