There are only a finite number of excluded minors for the class of bicircular matroids
暂无分享,去创建一个
We show that the class of bicircular matroids has only a finite number of excluded minors. Key tools used in our proof include representations of matroids by biased graphs and the recently introduced class of quasi-graphic matroids. We show that if N is an excluded minor of rank at least eight, then N is quasi-graphic. Several small excluded minors are quasi-graphic. Using biased-graphic representations, we find that N already contains one of these. We also provide an upper bound, in terms of rank, on the number of elements in an excluded minor, so
[1] Donald K. Wagner,et al. Connectivity in bicircular matroids , 1985, J. Comb. Theory, Ser. B.
[2] Bert Gerards,et al. Quasi-graphic matroids , 2018, J. Graph Theory.
[3] Thomas Zaslavsky. Frame Matroids and Biased Graphs , 1994, Eur. J. Comb..
[4] Daryl Funk,et al. Describing quasi-graphic matroids , 2018, Eur. J. Comb..
[5] Collette R. Coullard,et al. Representations of bicircular matroids , 1991, Discret. Appl. Math..