Gammoids, pseudomodularity and flatness degree

Publication date 11 March 2015

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.4127, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p54

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

directed graphs gammoids matroid theory pseudomodularity

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Abstract: We study weaker variations of the property of flatness in matroid theory. We show that these variations form a chain of increasingly stronger properties all implying pseudomodularity on its lattice of flats. We show examples in the gammoid class that show that these properties are in fact different.

Review text

Summary: We introduce the concept of flatness degree for matroids, as a generalization of submodularity. This represents weaker variations of the concept of flatness which characterize strict gammoids for finite matroids. We prove that having flatness degree 3, which is the smallest non-trivial flatness degree, implies pseudomodularity on the lattice of flats of the matroid. We show however an example of a gammoid for which the converse is not true. We also show examples of gammoids with each possible flatness degree. All of this examples show that pseudomodular gammoids are not necessarily strict.

Recommendations

Cites work

This page was built for publication: Gammoids, pseudomodularity and flatness degree

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