Minimal feedback sets in binary oriented matroids

Tamás Király


An essential lemma in the proof of Gallai's conjecture by Bessy and Thomassé is the following: In every strongly connected digraph there is a feedback arc set F with the property that for every edge e there is a directed circuit containing e that contains only one edge of F. We show that this lemma can be naturally extended to binary oriented matroids.

Bibtex entry:

AUTHOR = {Kir{\'a}ly, Tam{\'a}s},
TITLE = {Minimal feedback sets in binary oriented matroids},
NOTE= {{\tt www.cs.elte.hu/egres}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2006},
NUMBER = {QP-2006-01}

Last modification: 29.12.2019. Please email your comments to Tamás Király!