Sciweavers

ARSCOM
1999
54views more  ARSCOM 1999»
14 years 4 days ago
Refining the Graph Density Condition for the Existence of Almost K-factors
Alon and Yuster [4] have proven that if a fixed graph K on g vertices is (h + 1)-colorable, then any graph G with n vertices and minimum degree at least h h+1 n contains at least ...
Noga Alon, Eldar Fischer
DM
2010
71views more  DM 2010»
14 years 16 days ago
Max k-cut and judicious k-partitions
Alon, Bollob
Béla Bollobás, Alex D. Scott