Rate

To link to the entire object, paste this link in email, IM or document

To embed the entire object, paste this HTML in website

To link to this page, paste this link in email, IM or document

To embed this page, paste this HTML in website

Minimum partition of a matroid into independent subsets

Page 1

1 of 6

View Description

Download

small (250x250 max)

medium (500x500 max)

large ( > 500x500)

Full Resolution

All (PDF)

This page

All

Subset

Text Search...

you wish to report:

Your comment:

Your Name:

Submit

Cancel

...

Rating
Title	Minimum partition of a matroid into independent subsets
Author	Edmonds, Jack
SeriesTitle	Journal of Research of the National Bureau of Standards-B. Mathematics and Mathematical Physics
Date	1965-01
Language	English
Keywords	Independent subsets; matroid M; minimum partition
Abstract	A matroid M is a finite set M of elements with a family of subsets, called independent, such that (1) every subset of an independent set is independent, and (2) for every subset A of M, all maximal independent subsets of A have the same cardinality, called the rank r(A) of A. It is proved that a matroid can be partitioned into as few as k sets, each independent, if and only if every subset A has cardinality at most k. R(A ).
Publisher	National Bureau of Standards
ISSN	0022-4340
Volume	69B
Issue	1 and 2
Page	67
Cite	J. Res. Bur. Stand., Vol. 69B, No. 1-2, p. 67
Rights	The Journal of Research of the National Institute of Standards and Technology is a publication of the U.S. Government. The papers are in the public domain and are not subject to copyright in the United States. However, please pay special attention to the individual works to make sure there are no copyright restrictions indicated. Individual works may require securing other permissions from the original copyright holder.

	All
	Pages Enter page numbers or page ranges separated by commas. For example: 1,3,5-12