Branch-width, parse trees, and monadic second-order logic for matroids

We introduce “matroid parse trees” which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounded branch-width over a finite field. We prove that if M is a family of matroids described by a sentence in the monadic second-order logic of...

Full description

Bibliographic Details

Published in:	Journal of combinatorial theory. Series B Vol. 96; no. 3; pp. 325 - 351
Main Author:	Hliněný, Petr
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.05.2006
Subjects:	Branch-width Fixed-parameter complexity Matroid representation Monadic second-order logic Tree automaton secondary 68R05 Fixed-parameter complexity 03D05 Matroid representation Monadic second-order logic primary 05B35 Tree automaton Branch-width
ISSN:	0095-8956, 1096-0902
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!