English

On the density of matroids omitting a complete-graphic minor

Combinatorics 2023-06-28 v1

Abstract

We show that, if MM is a simple rank-nn matroid with no \ell-point line minor and no minor isomorphic to the cycle matroid of a tt-vertex complete graph, then the ratio M/n|M| / n is bounded above by a singly exponential function of \ell and tt. We also bound this ratio in the special case where MM is a frame matroid, obtaining an answer that is within a factor of two of best-possible.

Keywords

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