Lower bounds for online bin covering-type problems

2018 ◽  
Vol 22 (4) ◽  
pp. 487-497
Author(s):  
János Balogh ◽  
Leah Epstein ◽  
Asaf Levin
Keyword(s):  
2005 ◽  
Vol 39 (3) ◽  
pp. 163-183 ◽  
Author(s):  
Luke Finlay ◽  
Prabhu Manyem

Author(s):  
Parinya CHALERMSOOK ◽  
Hiroshi IMAI ◽  
Vorapong SUPPAKITPAISARN

2020 ◽  
Vol 148 (2) ◽  
pp. 321-327
Author(s):  
Rodolfo Gutiérrez-Romo ◽  
Carlos Matheus
Keyword(s):  

10.37236/1188 ◽  
1994 ◽  
Vol 1 (1) ◽  
Author(s):  
Geoffrey Exoo

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.


Sign in / Sign up

Export Citation Format

Share Document