Sciweavers

JGT
2007
81views more  JGT 2007»
13 years 10 months ago
Maximum directed cuts in acyclic digraphs
It is easily shown that every digraph with m edges has a directed cut of size at least m/4, and that 1/4 cannot be replaced by any larger constant. We investigate the size of a la...
Noga Alon, Béla Bollobás, Andr&aacut...