Packing directed circuits fractionally

Research output: Contribution to journalArticlepeer-review

146 Scopus citations

Abstract

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 languageEnglish (US)
Pages (from-to)281-288
Number of pages8
JournalCombinatorica
Volume15
Issue number2
DOIs
StatePublished - Jun 1 1995
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Packing directed circuits fractionally'. Together they form a unique fingerprint.

Cite this