首页 | 本学科首页   官方微博 | 高级检索  
     


On the Ramsey numbers R(3, 8) and R(3, 9)
Authors:Charles M Grinstead  Sam M Roberts
Affiliation:1. Department of Mathematics, Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061 USA;2. Department of Mathematics, Dartmouth College, Hanover, New Hampshire 03755 USA
Abstract:
Using methods developed by Graver and Yackel, and various computer algorithms, we show that 28 ≤ R(3, 8) ≤ 29, and R(3, 9) = 36, where R(k, l) is the classical Ramsey number for 2-coloring the edges of a complete graph.
Keywords:Current addresses are: Charles M. Grinstead   Department of Mathematics   Swarthmore College   Swarthmore   Pa. 19081 and Sam Roberts   Boalt Hall   University of California   Berkeley   Calif. 94720. All correspondence should be with Dr. Grinstead.
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号