Random packing by matroid bases and triangles
type: Item
instance of: scholarly article
title: Random packing by matroid bases and triangles
zbMATH Open document ID: 0839.05026
DOI: 10.1016/0012-365X(94)00050-S
author: Safwan Akkari
published in: Discrete Mathematics
publication date: 1996-06-05T00:00:00Z
review text: A matroid \(M\) on the set \(E\) is said to be packable by bases if \(E\) is the disjoint union of bases of \(M\). It is randomly packable by bases if every collection of pairwise disjoint bases may be extended to a disjoint collection with \(E\) as its union. This paper is devoted to exploring packability by bases and other structures and includes results like the following theorem. Let \(M\) be a connected matroid having rank \(r\). If \(M\) is randomly packable by bases, then \(M\) is identically self-dual or isomorphic to \(\mathbb{U}_{r, kr}\) for some positive integer \(k\).
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 810252
zbMATH Keywords: matroid
zbMATH Keywords: bases
zbMATH Keywords: packability
reviewed by: Jack E. Graver
MaRDI profile type: Publication
cites work: Q3035337
cites work: Random packings of graphs
cites work: SOME RESULTS ON TRANSVERSAL MATROIDS AND CONSTRUCTIONS FOR IDENTICALLY SELF-DUAL MATROIDS
cites work: A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs
cites work: Q4165400
cites work: Boolean designs and self-dual matroids
cites work: Q3135082
cites work: Randomly decomposable graphs
description: scientific article; zbMATH DE number 810252