On packing spanning trees in graphs and bases in matroids

Details On packing spanning trees in graphs and bases in matroids On packing spanning trees in graphs and bases in matroids

2012-03-05

arxiv.org/abs/1203.1014v1

Mathematics

Combinatorics

14 pages, 5 figures. arXiv admin note: substantial text overlap with arXiv:1012.2478

Scientific paper

We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We provide structural descriptions of such graphs and matroids. In the case of graphs, our results are relevant for certain communication protocols.

Affiliated with

Also associated with

No associations

Rating

On packing spanning trees in graphs and bases in matroids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On packing spanning trees in graphs and bases in matroids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On packing spanning trees in graphs and bases in matroids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-134081