Sciweavers

CPC
2000
58views more  CPC 2000»
14 years 8 days ago
Packing Ferrers Shapes
Answering a question of Wilf, we show that if n is sufficiently large, then one cannot cover an n
Noga Alon, Miklós Bóna, Joel Spencer