Title

On a packing problem for infinite graphs and independence spaces

Document Type

Article

Publication Date

1-1-1979

Abstract

In this paper several infinite extensions of the well-known results for packing bases in finite matroids are considered. A counterexample is given to a conjecture of Nash-Williams on edge-disjoint spanning trees of countable graphs, and a sufficient condition is proved for the packing problem in independence spaces over a countably infinite set. © 1979.

Publication Source (Journal or Book title)

Journal of Combinatorial Theory, Series B

First Page

123

Last Page

130

This document is currently not available here.

Share

COinS