𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A New Upper Bound for the Cylinder Packing Problem

✍ Scribed by M.H. Correia; J.F. Oliveira; J.S. Ferreira


Book ID
108572750
Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
239 KB
Volume
8
Category
Article
ISSN
0969-6016

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A new upper bound for the bipartite Rams
✍ David Conlon πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 89 KB πŸ‘ 1 views

## Abstract We consider the following question: how large does __n__ have to be to guarantee that in any two‐coloring of the edges of the complete graph __K__~__n,n__~ there is a monochromatic __K__~__k,k__~? In the late 1970s, Irving showed that it was sufficient, for __k__ large, that __n__ β‰₯ 2^_