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.
On the th best base of a matroid
β Scribed by Brahim Chaourar
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 128 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
BjGmer, A. and J. Karlander, Invertibility of the base Radon transform of a matroid, Discrete Mathematics 108 (1992) 139-147. Let M be a matroid of rank r on n elements and let F be a field. Assume that either char F = 0 or char F > r. It is shown that the point-base incidence matrix of M has rank
We show that the set of r-quasi-transversals of a matroid, if nonempty, is the set of bases of a matroid. We also give an alternative proof of the known theorem which identifies the conjugate of the rank partition of a matroid.
8% show that for my group If (Bnhc of infhitee) there exists an indepmdence structure with autans~~qMsm gruep i.wmcwphic ts ff. The pmof is by construction and shows that 5 1 Introduction We show &at for any graup N f'finite CH infinite) there exists an independence structure with autamorphism grou
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