ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let MM be a kk-base matroid, meaning that its ground set can be partitioned into kk bases, and let P\mathcal{P} be a partition of E(M)E(M) such that

∣X∣≤k−1|X|\leq k-1

for every X∈PX\in\mathcal{P}. Rainbow base factorization conjecture. Then MM can be factorized into kk rainbow bases. The case k=2k=2 is stated to be trivial, while the conjecture is presented as an optimistic open problem motivated by factorization under small partition classes.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.