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

On the connectivity function of a matroid

โœ Scribed by P.D Seymour

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
295 KB
Volume
45
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

Matroids having the same connectivity fu
Matroids having the same connectivity function
โœ Manoel Lemos ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 532 KB

We define the connectivity function of a matroid M on a set ## E as c(M; X)=r(X)+r(E\X)-r(E)+ 1(X c E), where r is the rank function of M. Cunningham conjectured that a connected matroid is determined, up to duality, by its connectivity function. proved this for binary matroids and we shall prov

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.