Poljak–Turzík's sticky matroid conjecture
Statement
We assume all matroids are finite. A matroid is sticky if, for every two matroids and with
there is a matroid such that
where denotes the ground set of .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.