✦ LIBER ✦

On matroids without a non-Fano minor

✍ Scribed by J.F. Geelen

Book ID: 108316342
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 81 KB
Volume: 203
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00029-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On minors of non-binary matroids

✍ P. D. Seymour 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 393 KB

A class of non-binary matroids with many

A class of non-binary matroids with many binary minors

✍ Allan D. Mills; James G. Oxley 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 154 KB

Cycle Bases for Lattices of Binary Matro

Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions

✍ Tamás Fleiner; Winfried Hochstättler; Monique Laurent; Martin Loebl 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 185 KB

In this paper we study the question of existence of a basis consisting only of cycles for the lattice Z(M) generated by the cycles of a binary matroid M. We show that if M has no Fano dual minor, then any set of fundamental circuits can be completed to a cycle basis of Z(M); moreover, for any one-el

A note on the production of matroid mino

A note on the production of matroid minors

✍ P.D Seymour 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 429 KB

A note on binary matroid with no -minor

✍ Xiangqian Zhou 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 79 KB

A minor-monotone graph parameter based o

A minor-monotone graph parameter based on oriented matroids

✍ Jack Edmonds; Monique Laurent; Alexander Schrijver 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 573 KB

For an undirected graph G = (V,E) let i'(G) be the largest d for which there exists an oriented matroid M on V of corank d such that for each nonzero vector (x+,x-) of M, x+ is nonempty and induces a connected subgraph of G. We show that I'(G) is monotone under taking minors and clique sums. Moreov