Sticky polymatroids on at most five elements

2019/11/11 by Csirmaz, Laszlo
#05B35 06C10 52B40 #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1911.04205

Abstract

The sticky polymatroid conjecture states that any two extensions of the polymatroid have an amalgam if and only if the polymatroid has no non-modular pairs of flats. We show that the conjecture holds for polymatroids on five or less elements.

Related

• One-adhesive polymatroids
• Realizable Sticky Matroid Conjecture
• The Sticky Matroid Conjecture
• Enumeration of 2-Polymatroids on up to Seven Elements
• Sticky matroids and Kantor's Conjecture