The rank formula of Nash-Williams as a source of covering and packing theorems
From MaRDI portal
Publication:2562089
DOI10.1016/0022-247X(73)90077-2zbMath0266.05013MaRDI QIDQ2562089
Publication date: 1973
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of packing and covering (05B40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Transversal theory. An account of some aspects of combinatorial mathematics
- A theorem on common transversals
- Hall's criterion as a 'self-refining' result
- Some Generalizations of the Problem of Distinct Representatives
- Disjoint Transversals of Subsets
- A Network-Flow Feasibility Theorem and Combinatorial Applications
- A Combinatorial Theorem on Vector Spaces
- On Representatives of Subsets
- Transversals and matroid partition
- Applications of the notion of independence to problems of combinatorial analysis
- The Linking of Sets in Graphs
- An Extension of Banach's Mapping Theorem
- Minimum partition of a matroid into independent subsets
- TRANSVERSALS OF SUBSETS
- On Matroid Theorems of Edmonds and Rado
- Common Partial Transversals and Integral Matrices
- On Families of Finite Independence Structures
- A THEOREM ON INDEPENDENCE RELATIONS
- A Characterization of Union of Linearly Independent Sets
This page was built for publication: The rank formula of Nash-Williams as a source of covering and packing theorems
