Matroids having the same connectivity function
β Scribed by Manoel Lemos
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 532 KB
- Volume
- 131
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
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 prove it in general provided
r(M)#r(M*).
Seymour in 1988 gave a counterexample for this conjecture.
or M,.
As a corollary of Theorem 1, we have the following result.
π SIMILAR VOLUMES
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
Aidan Greene and Liam McCullough feel like theyβve aged out of the bodyguard business - but a desperate call from former client Slava Vishinev draws them back. In a story ripped from the headlines, Slavaβs gay son Arseny has vanished in Chechnya, where homosexuals are persecuted and imprisoned. What
An element e of a 3-connected matroid M is essential if neither the deletion M\e nor the contraction M/e is 3-connected. Tutte's Wheels and Whirls Theorem proves that the only 3-connected matroids in which every element is essential are the wheels and whirls. In this paper, we consider those 3-conne