Work

Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers

Year: 1972
Type: article
Abstract: Consider a finite nonnull graph $G$ with no loops or multiple edges and no isolated points. Its Ramsey number $r(G)$ is defined as the minimum number $p$ such that every 2-coloring of the lines of the complete graph $K_p$ must contain a monochromatic $G$. This generalizes the classical diagonal Ramsey numbers $r(n, n) = r(K_n)$. We obtain the exact value of the Ramsey number of every such graph with at most four points.
Language: English
Open Access status: bronze
OpenAlex ID: W1993783695
FWCI: 7.073
Cites: 7
Cited by: 121
Related to: 10