Random packing by matroid bases and triangles
From MaRDI portal
Publication:1901027
DOI10.1016/0012-365X(94)00050-SzbMath0839.05026MaRDI QIDQ1901027
Publication date: 5 June 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomly decomposable graphs
- Boolean designs and self-dual matroids
- Random packings of graphs
- SOME RESULTS ON TRANSVERSAL MATROIDS AND CONSTRUCTIONS FOR IDENTICALLY SELF-DUAL MATROIDS
- A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs
This page was built for publication: Random packing by matroid bases and triangles