Abstract
AbstractHliněný’s Theorem shows that any sentence in the monadic second-order logic of matroids can be tested in polynomial time, when the input is limited to a class of $${\mathbb {F}}$$
F
-representable matroids with bounded branch-width (where $${\mathbb {F}}$$
F
is a finite field). If each matroid in a class can be decomposed by a subcubic tree in such a way that only a bounded amount of information flows across displayed separations, then the class has bounded decomposition-width. We introduce the pigeonhole property for classes of matroids: if every subclass with bounded branch-width also has bounded decomposition-width, then the class is pigeonhole. An efficiently pigeonhole class has a stronger property, involving an efficiently-computable equivalence relation on subsets of the ground set. We show that Hliněný’s Theorem extends to any efficiently pigeonhole class. In a sequel paper, we use these ideas to extend Hliněný’s Theorem to the classes of fundamental transversal matroids, lattice path matroids, bicircular matroids, and $$H$$
H
-gain-graphic matroids, where H is any finite group. We also give a characterisation of the families of hypergraphs that can be described via tree automata: a family is defined by a tree automaton if and only if it has bounded decomposition-width. Furthermore, we show that if a class of matroids has the pigeonhole property, and can be defined in monadic second-order logic, then any subclass with bounded branch-width has a decidable monadic second-order theory.
Funder
Victoria University of Wellington
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference26 articles.
1. Bixby, R.E., Cunningham, W.H.: Matroid optimization and algorithms. In: Handbook of Combinatorics, vol. 1, 2, pp. 551–609. Elsevier, Amsterdam (1995)
2. Bonin, J.E.: Lattice path matroids: the excluded minors. J. Comb. Theory Ser. B 100(6), 585–599 (2010)
3. Bonin, J.E., Kung, J.P.S., de Mier, A.: Characterizations of transversal and fundamental transversal matroids. Electron. J. Comb. 18(1), 106, 16 (2011)
4. Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12–75 (1990)
5. Cunningham, W.H.: Improved bounds for matroid partition and intersection algorithms. SIAM J. Comput. 15(4), 948–957 (1986)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Tree Automata and Pigeonhole Classes of Matroids: II;The Electronic Journal of Combinatorics;2023-07-14