The highly connected even-cycle and even-cut matroids
Combinatorics
2020-06-02 v2
Abstract
The classes of even-cycle matroids, even-cycle matroids with a blocking pair, and even-cut matroids each have hundreds of excluded minors. We show that the number of excluded minors for these classes can be drastically reduced if we consider in each class only the highly connected matroids of sufficient size.
Keywords
Cite
@article{arxiv.1610.01106,
title = {The highly connected even-cycle and even-cut matroids},
author = {Kevin Grace and Stefan H. M. van Zwam},
journal= {arXiv preprint arXiv:1610.01106},
year = {2020}
}
Comments
Version 2 is a major revision, including a correction of an error in the statement of one of the main results and improved exposition. It is 89 pages, including a 33-page Jupyter notebook that contains SageMath code and that is also available in the ancillary files