Odd Perfect Numbers: A Search Procedure, and a New Lower Bound of 10 36

1973 ◽  
Vol 27 (124) ◽  
pp. 1004
Author(s):  
D. S. ◽  
Bryant Tuckerman

1973 ◽  
Vol 27 (124) ◽  
pp. 943-943 ◽  
Author(s):  
Bryant Tuckerman


2015 ◽  
Vol 4 ◽  
pp. 99-103
Author(s):  
Keneth Adrian P. Dagal
Keyword(s):  


10.37236/2102 ◽  
2012 ◽  
Vol 19 (1) ◽  
Author(s):  
Geoffrey Exoo

The lower bound for the classical Ramsey number $R(4,6)$ is improved from 35 to 36. The author has found 37 new edge colorings of $K_{35}$ that have no complete graphs of order 4 in the first color, and no complete graphs of order 6 in the second color. The most symmetric of the colorings has an automorphism group of order 4, with one fixed point, and is presented in detail. The colorings were found using a heuristic search procedure.



1973 ◽  
Vol 27 (124) ◽  
pp. 951-951 ◽  
Author(s):  
Peter Hagis
Keyword(s):  




1989 ◽  
Vol 53 (187) ◽  
pp. 431 ◽  
Author(s):  
Richard P. Brent ◽  
Graeme L. Cohen
Keyword(s):  


1989 ◽  
Vol 53 (187) ◽  
pp. S7
Author(s):  
Richard P. Brent ◽  
Graeme L. Cohen
Keyword(s):  


Sign in / Sign up

Export Citation Format

Share Document