𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


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.

Invertibility of the base Radon transfor
✍ Anders BjΓΆrner; Johan Karlander πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 512 KB

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

On the quasi-transversals of a matroid
✍ Richard A. Brualdi; AmΓ©lia Fonseca πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 220 KB

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.

On the automorphism group of a matroid
✍ F. Harary; M.J. Piff; D.J.A. Welsh πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 983 KB

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

On the Connectivity Function of a Binary
✍ 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