Generalized connectivity conjecture for matroids with circuits and cocircuits of different cardinalities
Generalized connectivity conjecture for matroids with circuits and cocircuits of different cardinalities
Let be positive integers and let be a matroid. A matroid is -connected in the usual matroid-connectivity sense; and denote deletion and contraction of a set , respectively. An -spike is a matroid of the corresponding generalized spike type.
Generalized connectivity conjecture. There exists a function such that if has no circuits of size at most , no cocircuits of size at most , is -connected, and
then at least one of the following holds: there exists an -element set such that is -connected; there exists a -element set such that is -connected; or is an -spike.
This is proposed as a generalization of the earlier conjecture, whose symmetric case has circuits and cocircuits of the same forbidden size. The source notes that sufficiently large -spikes provide the obstruction, but does not report a proof or disproof of the generalized claim.
Sources & referencesView supporting material
Primary source
Nick Brettell and Kevin Grace, “Generalized spikes with circuits and cocircuits of different cardinalities”, arXiv:2209.14524 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.