Addendum to matroid tree-width

Authors:
Petr Hlinný;Geoff Whittle
Affiliations:
Faculty of Informatics, Masaryk University, Botanická 68a, 60200 Brno, Czech Republic;School of Mathematical and Computing Sciences, Victoria University, P.O. Box 600, Wellington, New Zealand
Venue:
European Journal of Combinatorics
Year:
2009

Citing 2
Cited 6

Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Matroid tree-width

European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures

On minimal tree realizations of linear codes

IEEE Transactions on Information Theory
Constraint complexity of realizations of linear codes on arbitrary graphs

IEEE Transactions on Information Theory
Decomposition width of matroids

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Linked tree-decompositions of represented infinite matroids

Journal of Combinatorial Theory Series B
Decomposition width of matroids

Discrete Applied Mathematics
Deciding first order properties of matroids

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	0.12

Visualization

Abstract

Hliněný and Whittle have shown that the traditional tree-width notion of a graph can be defined without an explicit reference to vertices, and that it can be naturally extended to all matroids. Unfortunately their original paper [P. Hliněný, G. Whittle, Matroid tree-width, European J. Combin. 27 (2006) 1117-1128], as pointed out by Isolde Adler in 2007, contained some incorrect arguments. It is the purpose of this addendum to correct the affected proofs. (All the theorems and results of the original paper remain valid.)