Random packing by matroid bases and triangles
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\).
- A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs
- Boolean designs and self-dual matroids
- scientific article; zbMATH DE number 4134097 (Why is no real title available?)
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3598496 (Why is no real title available?)
- Random packings of graphs
- Randomly decomposable graphs
- SOME RESULTS ON TRANSVERSAL MATROIDS AND CONSTRUCTIONS FOR IDENTICALLY SELF-DUAL MATROIDS
This page was built for publication: Random packing by matroid bases and triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901027)
