English

Random GF(q)-representable matroids are not (b,c)-decomposable

Combinatorics 2022-08-11 v1

Abstract

We show that a random subset of the rank-nn projective geometry PG(n1,q)\text{PG}(n-1,q) is, with high probability, not (b,c)(b,c)-decomposable: if kk is its colouring number, it does not admit a partition of its ground set into classes of size at most ckck, every transversal of which is bb-colourable. This generalises recent results by Abdolazimi, Karlin, Klein, and Oveis Gharan (arXiv:2111.12436) and by Leichter, Moseley, and Pruhs (arXiv:2206.12896), who showed that PG(n1,q)\text{PG}(n-1,q) is not (1,c)(1,c)-decomposable, resp. not (b,c)(b,c)-decomposable.

Keywords

Cite

@article{arxiv.2208.05464,
  title  = {Random GF(q)-representable matroids are not (b,c)-decomposable},
  author = {Jorn van der Pol},
  journal= {arXiv preprint arXiv:2208.05464},
  year   = {2022}
}

Comments

6 pages

R2 v1 2026-06-25T01:37:48.094Z