ramsey数简介（英文）

Ramsey Number

The Ramsey number gives the solution to the party problem, which asks the minimum number of guests that must be invited so that at least will know each other or at least will not know each other. In the language of graph theory, the Ramsey number is the minimum number of vertices such that all undirected simple graphs of order contain a clique of order or an independent set of order . Ramsey's theorem states that such a number exists for all and . By symmetry, it is true that (1) It also must be true that (2) A generalized Ramsey number is written (3) and is the smallest integer such that, no matter how each -element subset of an -element set is colored with colors, there exists an such that there is a subset of size , all of whose -element subsets are color . The usual Ramsey numbers are then equivalent to . Bounds are given by (4) and (5) (Chung and Grinstead 1983). Erdos proved that for diagonal Ramsey numbers , (6) This result was subsequently improved by a factor of 2 by Spencer (1975). was known since 1980 to be bounded from above by , and Griggs (1983) showed that was an acceptable limit. J.-H. Kim (Cipra 1995) subsequently bounded by a similar expression from below, so (7) Burr (1983) gives Ramsey numbers for all 113 graphs with no more than 6 graph edges and no isolated points. A summary of known results up to 1983 for is given in Chung and Grinstead (1983). Radziszowski (2004) maintains an up-to-date list of the best current bounds. Results from Tables I and II of Radziszowski (2004) are reproduced below in a slightly less cramped format than in the original. Known bounds for generalized Ramsey numbers (multicolor graph numbers), hypergraph Ramsey numbers, and many other types of Ramsey numbers may be found in Radziszowski (2000). In the absence of a published upper bound, the theorem of Erdos-Szekeres stating that is used to provide one. Reference 3 3 6 Greenwood and Gleason 1955 3 4 9 Greenwood and Gleason 1955 3 5 14 Greenwood and Gleason 1955 3 6 18 Graver and Yackel 1968 3 7 23 Kalbfleisch 1966 3 8 28 McKay and Min 1992 3 9 36 Grinstead and Roberts 1982 3 10 [40, 43] Exoo 1989c, Radziszowski and Kreher 1988 3 11 [46, 51] Radziszowski and Kreher 1988 3 12 [52, 59] Exoo 1993, Radziszowski and Kreher 1988, Exoo 1998, Lesser 2001 3 13 [59, 69] Piwakowski 1996, Radziszowski and Kreher 1988 3 14 [66, 78] Exoo (unpub.), Radziszowski and Kreher 1988 3 15 [73, 88] Wang and Wang 1989, Radziszowski (unpub.), Lesser 2001 3 16 [79, 135] Wang and Wang 1989 3 17 [92, 152] Wang et al. 1994 3 18 [98, 170] Wang et al. 1994 3 19 [106, 189] Wang et al. 1994 3 20 [109, 209]