𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounding the number of bases of a matroid

✍ Scribed by Guoli Ding


Publisher
Springer-Verlag
Year
1995
Tongue
English
Weight
377 KB
Volume
15
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A lower bound on connectivities of matro
✍ Guizhen Liu πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 853 KB

The connectivity of a graph G and the corank of a matroid M are denoted by K(G) and p, respectively. X is shown that if a graph G is the base graph of a simple mat&d M, then K(G) L 2p and the lower bound of 2p izA best possible.

Weight distribution of the bases of a bi
✍ S. Zhou πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 399 KB

Let M be a weighted binary matroid and UJ~ < . < w,,, be the increasing sequence of all possible distinct weights of bases of M. We give a sufficient condition for the property that Wl,..., wm is an arithmetical progression of common difference d. We also give conditions which guarantee that wi+l -w