Rainbow base factorization conjecture for bounded partition classes
Statement
Let be a -base matroid, meaning that its ground set can be partitioned into bases, and let be a partition of such that
for every . Rainbow base factorization conjecture. Then can be factorized into rainbow bases. The case 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.