On Matroid Properties Definable in the MSO Logic
It has been proved by the author that all matroid properties definable in the monadic second-order (MSO) logic can be recognized in polynomial time for matroids of bounded branch-width which are represented by matrices over finite fields. (This result extends so called “MS 2-theorem” of graphs by Courcelle and others.) In this work we review the MSO theory of finite matroids and show some interesting matroid properties which are MSO-definable. In particular, all minor-closed properties are recognizable in such way.
Keywordsmatroid branch-width MSO logic parametrized complexity
Unable to display preview. Download preview PDF.
- 4.Downey, R.G., Fellows, M.R.: Parametrized Complexity. Springer, Heidelberg (1999)Google Scholar
- 5.Geelen, J.F., Gerards, A.H.M., Robertson, N., Whittle, G.P.: On the Excluded Minors for the Matroids of Branch-Width k. J. Combin. Theory Ser. B (2003) (to appear) Google Scholar
- 8.Hliněný, P.: Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids (2002) (submitted)Google Scholar
- 9.Hliněný, P.: A Parametrized Algorithm for Matroid Branch-Width (2002) (submitted)Google Scholar
- 10.Hliněný, P.: The Tutte Polynomial for Matroids of Bounded Branch-Width (2002) (submitted)Google Scholar
- 11.Hliněný, P.: It is Hard to Recognize Free Spikes (2002) (submitted) Google Scholar