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

Abstract

We show that a random subset of the rank-n projective geometry PG(n-1,q) is, with high probability, not (b,c)-decomposable: if k is its colouring number, it does not admit a partition of its ground set into classes of size at most ck, every transversal of which is b-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) is not (1,c)-decomposable, resp. not (b,c)-decomposable.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…