On the density of matroids omitting a complete-graphic minor
Combinatorics
2023-06-28 v1
Abstract
We show that, if is a simple rank- matroid with no -point line minor and no minor isomorphic to the cycle matroid of a -vertex complete graph, then the ratio is bounded above by a singly exponential function of and . We also bound this ratio in the special case where is a frame matroid, obtaining an answer that is within a factor of two of best-possible.
Cite
@article{arxiv.2306.15061,
title = {On the density of matroids omitting a complete-graphic minor},
author = {Peter Nelson and Sergey Norin and Fernanda Rivera Omana},
journal= {arXiv preprint arXiv:2306.15061},
year = {2023}
}
Comments
25 pages