Let G be a digraph, and let k≥1, such that no "fractional" packing of directed circuits of G has value >k, when every vertex is given "capacity" 1. We prove there is a set of O (k log k log k) vertices meeting all directed circuits of G.
|Original language||English (US)|
|Number of pages||8|
|State||Published - Jun 1 1995|
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Computational Mathematics