ProbXiv
Explorersign in
Problem archiveProblem record

Statement

We assume all matroids are finite. A matroid MM is sticky if, for every two matroids M1M_1 and M2M_2 with

M=M1∣E(M)=M2∣E(M),M=M_1|_{E(M)}=M_2|_{E(M)},

there is a matroid M~\widetilde{M} such that

M1=M~∣E(M1)andM2=M~∣E(M2),M_1=\widetilde{M}|_{E(M_1)}\quad\text{and}\quad M_2=\widetilde{M}|_{E(M_2)},

where E(N)E(N) denotes the ground set of NN.

Sticky matroid conjecture. Stickiness of a matroid implies modularity. Thus, stickiness is equivalent to modularity.

Poljak and Turzík showed in 1982 that every modular matroid is sticky, so the conjecture asserts the converse. The supplied source does not state whether this converse has been resolved.

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.