Packing directed circuits

Bruce Reed; Neil Robertson; Paul Seymour; Robin Thomas

doi:10.1007/BF01271272

Packing directed circuits

Bruce Reed
, Neil Robertson
, Paul Seymour
, Robin Thomas

Research output: Contribution to journal › Article › peer-review

95 Scopus citations

Abstract

We prove a conjecture of Younger, that for every integer n ≥ 0 there exists an integer t ≥ 0 such that for every digraph G, either G has n vertex-disjoint directed circuits, or G can be made acyclic by deleting at most t vertices.

Original language	English (US)
Pages (from-to)	535-554
Number of pages	20
Journal	Combinatorica
Volume	16
Issue number	4
DOIs	https://doi.org/10.1007/BF01271272
State	Published - 1996
Externally published	Yes

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics
Computational Mathematics

Access to Document

10.1007/BF01271272

Cite this

@article{7bd401c6dd44485b81dfbdceeced2753,

title = "Packing directed circuits",

abstract = "We prove a conjecture of Younger, that for every integer n ≥ 0 there exists an integer t ≥ 0 such that for every digraph G, either G has n vertex-disjoint directed circuits, or G can be made acyclic by deleting at most t vertices.",

author = "Bruce Reed and Neil Robertson and Paul Seymour and Robin Thomas",

year = "1996",

doi = "10.1007/BF01271272",

language = "English (US)",

volume = "16",

pages = "535--554",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "4",

}

TY - JOUR

T1 - Packing directed circuits

AU - Reed, Bruce

AU - Robertson, Neil

AU - Seymour, Paul

AU - Thomas, Robin

PY - 1996

Y1 - 1996

N2 - We prove a conjecture of Younger, that for every integer n ≥ 0 there exists an integer t ≥ 0 such that for every digraph G, either G has n vertex-disjoint directed circuits, or G can be made acyclic by deleting at most t vertices.

AB - We prove a conjecture of Younger, that for every integer n ≥ 0 there exists an integer t ≥ 0 such that for every digraph G, either G has n vertex-disjoint directed circuits, or G can be made acyclic by deleting at most t vertices.

UR - https://www.scopus.com/pages/publications/0039336647

UR - https://www.scopus.com/pages/publications/0039336647#tab=citedBy

U2 - 10.1007/BF01271272

DO - 10.1007/BF01271272

M3 - Article

AN - SCOPUS:0039336647

SN - 0209-9683

VL - 16

SP - 535

EP - 554

JO - Combinatorica

JF - Combinatorica

IS - 4

ER -

Packing directed circuits

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this