A note on the sticky matroid conjecture

DOI10.1007/S00026-011-0112-7zbMATH Open1233.05076arXiv0906.2553OpenAlexW2012160996WikidataQ123029151 ScholiaQ123029151MaRDI QIDQ659658FDOQ659658

Joseph E. Bonin

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: A matroid is sticky if any two of its extensions by disjoint sets can be glued together along the common restriction (that is, they have an amalgam). The sticky matroid conjecture asserts that a matroid is sticky if and only if it is modular. Poljak and Turzik proved that no rank-3 matroid having two disjoint lines is sticky. We show that, for r at least 3, no rank-r matroid having two disjoint hyperplanes is sticky. These and earlier results show that the sticky matroid conjecture for finite matroids would follow from a positive resolution of the rank-4 case of a conjecture of Kantor.

Full work available at URL: https://arxiv.org/abs/0906.2553

Recommendations

• On sticky matroids
• Sticky polymatroids on at most five elements
• scientific article; zbMATH DE number 3880731
• On matroids with the same connectivity function
• scientific article

zbMATH Keywords

bundle conditioncyclic flatsticky matroid conjecture

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Semimodular lattices, geometric lattices (06C10)

Cites Work

• Title not available (Why is that?)
• An Affine Representation for Transversal Geometries
• Single-element extensions of matroids
• The lattice of cyclic flats of a matroid
• On sticky matroids
• A note on sticky matroids
• Dimension and embedding theorems for geometric lattices

Cited In (4)

• One-adhesive polymatroids
• Sticky matroids and Kantor's conjecture
• Title not available (Why is that?)
• On sticky matroids

This page was built for publication: A note on the sticky matroid conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659658)