Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421148 | Discrete Applied Mathematics | 2014 | 6 Pages |
Abstract
This paper shows that B(24)≥35B(24)≥35 and B(25)≥38B(25)≥38. The previous best lower bounds were B(24)≥27B(24)≥27 and B(25)≥29B(25)≥29. The new lower bounds and the known upper bounds show that B(24)=35B(24)=35 or 36 and B(25)=38,39B(25)=38,39 or 40. Also the new bounds prove that B(n)B(n) is monotone at least for all n≤32n≤32.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Georgy Barsky, Hayk Grigoryan, Hovhannes A. Harutyunyan,