𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Large Circuits in Matroids

✍ Scribed by Pou-Lin Wu

Book ID
105745141
Publisher
Springer Japan
Year
2001
Tongue
English
Weight
281 KB
Volume
17
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Large Circuits in Binary Matroids of Lar
Large Circuits in Binary Matroids of Large Cogirth, I
✍ Winfried HochstΓ€ttler; Bill Jackson πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 291 KB

Let F 7 denote the Fano matroid and e be a fixed element of F 7 . Let P(F 7 , e) be the family of matroids obtained by taking the parallel connection of one or more copies of F 7 about e. Let M be a simple binary matroid such that every cocircuit of M has size at least d 3. We show that if M does no

Large Circuits in Binary Matroids of Lar
Large Circuits in Binary Matroids of Large Cogirth, II
✍ Winfried HochstΓ€ttler; Bill Jackson πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 223 KB

Let F 7 denote the Fano matroid and M be a simple connected binary matroid such that every cocircuit of M has size at least d 3. We show that if M does not have an F 7 -minor, M{F\* 7 , and d Γ‚ [5, 6, 7, 8], then M has a circuit of size at least min[r(M )+1, 2d ]. We conjecture that the latter resul

Packing circuits in matroids
Packing circuits in matroids
✍ Guoli Ding; Wenan Zang πŸ“‚ Article πŸ“… 2008 πŸ› Springer-Verlag 🌐 English βš– 554 KB
On removable circuits in graphs and matr
On removable circuits in graphs and matroids
✍ Lemos, Manoel; Oxley, James πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 283 KB

Mader proved that every 2-connected simple graph G with minimum degree d exceeding three has a cycle C, the deletion of whose edges leaves a 2-connected graph. Jackson extended this by showing that C may be chosen to avoid any nominated edge of G and to have length at least d-1. This article proves

On Circuit Valuation of Matroids
On Circuit Valuation of Matroids
✍ Kazuo Murota; Akihisa Tamura πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 257 KB

The concept of valuated matroids was introduced by Dress and Wenzel as a quantitative extension of the base exchange axiom for matroids. This paper gives several sets of cryptomorphically equivalent axioms of valuated matroids in terms of R βˆͺ -∞ -valued vectors defined on the circuits of the underly