Minors of asymptotically almost all sparse paving matroids
Combinatorics
2016-05-10 v1
Abstract
We use counting arguments to show that asymptotically almost all sparse paving matroids contain an -minor, where falls into one of several simple classes of matroids. Furthermore the result holds for all in a larger class of matroids, if we restrict to asymptotically almost all sparse paving matroids of fixed rank (where is necessarily no smaller than the rank of ).
Keywords
Cite
@article{arxiv.1605.02414,
title = {Minors of asymptotically almost all sparse paving matroids},
author = {Will Critchlow},
journal= {arXiv preprint arXiv:1605.02414},
year = {2016}
}