Transversal packings and covers
ResearchPublished 1965
Examination of two combinatorial problems involving partial transversals of a collection of subsets of a finite set. This Memorandum shows that a problem of constructing a transversal packing can be formulated in terms of flows in networks, and existence conditions obtained form results in network flow theory. A similar approach is presented for an analogous covering problem involving partial transversals of prescribed sizes. Finally, connections are indicated between these problems and some recent results of Edmonds in matroid theory.
Document Details
- Copyright: RAND Corporation
- Availability: Web Only
- Year: 1965
- Pages: 18
- Document Number: RM-4411-PR
Citation
RAND Style Manual
Chicago Manual of Style
This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.