×
+ All Categories
Log in
English
Français
Español
Deutsch
Report -
New Computational Upper Bounds for Ramsey Numbers R ;k · Furthermore, e(3;k+ 1;n) = 6n 13k for k = 4t and n = 13t, and the inequality e(3;k+1;n) > 6n 13kholds for all nand k. All
Name
Email
Select
Select
Pornographic
Defamatory
Illegal/Unlawful
Spam
Other Terms Of Service Violation
File a copyright complaint
Message
Please pass captcha verification before submit form