Abstract
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 the largest directed cut in acyclic digraphs, and prove a number of related results concerning cuts in digraphs and acyclic digraphs.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1-13 |
| Number of pages | 13 |
| Journal | Journal of Graph Theory |
| Volume | 55 |
| Issue number | 1 |
| DOIs | |
| State | Published - May 2007 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Geometry and Topology
Keywords
- Directed and acyclic graphs
- Directed cut
- Extremal problems
- Maximum cut
Fingerprint
Dive into the research topics of 'Maximum directed cuts in acyclic digraphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver