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

preprint2022arXivOpen access

Abstract

We show that a random subset of the rank-nn projective geometry PG(n−1,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(n−1,q)\text{PG}(n-1,q) is not (1,c)(1,c)-decomposable, resp. not (b,c)(b,c)-decomposable.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.