论文信息 - All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8

All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8

In this paper we will give all Ramsey numbers r(K3, G) for connected graphs G of order 7 and 8. For smaller orders and non-connected graphs of order up to 8, the number of graphs with given Ramsey number is listed for all possible values.

Gunnar Brinkmann | G. Brinkmann

[1] A. Bonato,et al. Graphs and Hypergraphs , 2022 .

[2] Jack E. Graver,et al. Some graph theoretic results associated with Ramsey's theorem* , 1968 .

[3] Brendan D. McKay,et al. The value of the Ramsey number r(3, 8) , 1992, J. Graph Theory.

[4] Charles M. Grinstead,et al. On the Ramsey numbers, R(3,8) and R(3,9) , 1982 .

[5] Frank Harary,et al. Generalized Ramsey theory for graphs. III. Small off-diagonal numbers. , 1972 .

[6] Kemin Zhang,et al. The value of the Ramsey number R(Cn, K4) is 3(n-1)+1 (n≥4) , 1999, Australas. J Comb..

[7] Ingo Schiermeyer,et al. Ramsey Numbers r(K3, G) for Connected Graphs G of Order Seven , 1997, Discret. Appl. Math..

[8] Frank Harary,et al. Generalized Ramsey theory for graphs. II. Small diagonal numbers , 1972 .

[9] KlaweMaria,et al. Generalized ramsey theory for graphs, x , 1979 .

[10] Stephan Brandt,et al. The Generation of Maximal Triangle-Free Graphs , 2000, Graphs Comb..

[11] Richard H. Schelp,et al. All triangle-graph ramsey numbers for connected graphs of order six , 1980, J. Graph Theory.

[12] Brendan D. McKay,et al. Isomorph-Free Exhaustive Generation , 1998, J. Algorithms.

[13] Brendan D. McKay,et al. R(4, 5) = 25 , 1995, J. Graph Theory.

[14] M. Clancy,et al. Some small ramsey numbers , 1977, J. Graph Theory.

[15] Richard H. Schelp,et al. AN EXTREMAL PROBLEM IN GENERALIZED RAMSEY THEORY , 1980 .