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

Pairs of largest circuits in 3-connected matroids

โœ Scribed by Manoel Lemos; Talmage James Reid; Bryan Williams; Haidong Wu


Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
100 KB
Volume
427
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Triangles in 3-connected matroids
โœ Talmage James Reid ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 992 KB
Basis pair graphs of transversal matroid
โœ Martin Farber ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 460 KB

The basis pair graph of a matroid on the ground set S has, as its vertices, ordered triples of the form (&, &, &), where B, and B2 are disjoint bases and B3 = S\(B, U 4). Two such vertices, (AI, AZ, As) and (Ri, B,, IQ, are adjacent if (B,, &, B3) can be obtained from (AI, A\*, As) by interchanging

Unavoidable Minors of Large 3-Connected
โœ Guoli Ding; Bogdan Oporowski; James Oxley; Dirk Vertigan ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 704 KB

This paper proves that, for every integer n exceeding two, there is a number N(n) such that every 3-connected matroid with at least N(n) elements has a minor that is isomorphic to one of the following matroids: an (n+2)-point line or its dual, the cycle or cocycle matroid of K 3, n , the cycle matro

Unavoidable Minors of Large 3-Connected
โœ Guoli Ding; Bogdan Oporowski; James Oxley; Dirk Vertigan ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 759 KB

We show that, for every integer n greater than two, there is a number N such that every 3-connected binary matroid with at least N elements has a minor that is isomorphic to the cycle matroid of K 3, n , its dual, the cycle matroid of the wheel with n spokes, or the vector matroid of the binary matr