The triangle-graph Ramsey numbers are determined for all 814 of the 853 connected graphs of order seven. For the remaining 39 graphs lower and upper bounds are improved.
Ramsey numbers r(K3, G) for G ≅ K7 − 2P2 and G ≅ K7 − 3P2
✍ Scribed by Annette Schelten; Ingo Schiermeyer
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 304 KB
- Volume
- 191
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
their triangle-graph Ramsey numbers without using any computer support.
📜 SIMILAR VOLUMES
The Ramsey number r(H, G) is defined as the minimum N such that for any coloring of the edges of the N-vertex complete graph KN in red and blue, it must contain either a ted H or a blue G. In this paper we show that for any graph G without isolated vertices, r(K,, G)< 2qf 1 where G has q edges. In o
## Abstract For Abstract see ChemInform Abstract in Full Text.
Trigonal crystals of K\*ReF, show intense r7 ( 2Tzs) -+r r ( 4AZg) luminescence at 4 and 77 K under 5 14 nm excitation. Extensive vibronic structure is resolved which is dominated by the vibronic origins due to the trigonal components ofthe Ye, vq and Y) modes of the ReFa-ion. The vibrational disper