๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On a definition of connected sets of a matroid

โœ Scribed by D.J Hartfiel; C.J Maxson

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
269 KB
Volume
25
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Connectivity Function of a Binary
On the Connectivity Function of a Binary Matroid
โœ Manoel Lemos ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 210 KB

In this paper, we shall consider the following problem: up to duality, is a connected matroid reconstructible from its connectivity function? Cunningham conjectured that this question has an affirmative answer, but Seymour gave a counter-example for it. In the same paper, Seymour proved that a conne

A lower bound on connectivities of matro
A lower bound on connectivities of matroid base graphs
โœ 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.

The independent sets of rank k of a matr
The independent sets of rank k of a matroid
โœ G. Purdy ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 466 KB

We determine the minimum num>er of independent sets of arbitrary fixed rank contained in a matroid M as M varies over all simple (respectively loopless) matroids of fixed rank and cardinality.