Sciweavers

JGT
2007

Maximum directed cuts in acyclic digraphs

13 years 11 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 largest directed cut in acyclic digraphs, and prove a number of related results concerning cuts in digraphs and acyclic digraphs.
Noga Alon, Béla Bollobás, Andr&aacut
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where JGT
Authors Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott
Comments (0)