✦ LIBER ✦

On a matroid identity

✍ Scribed by James G. Oxley

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 443 KB
Volume: 44
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90006-7

No coin nor oath required. For personal study only.

✦ Synopsis

The purpose of this note is to prove an identity for generalized Tuttffirothendieck invariants. at least two special cases of which have already proved to be of considerable use. In addition, one of these special cases is used to strengthen results of Lindstriim on the critical exponent of a representable matroid and the chromatic number of a regular matroid.

📜 SIMILAR VOLUMES

A Möbius Identity Arising from Modularit

A Möbius Identity Arising from Modularity in a Matroid Bilinear Form

✍ T. Brylawski 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 176 KB

The matrix for the bilinear form of the flag space of a matroid has (with respect to an appropriate basis) a tensor product structure when the matroid has a modular flat K. When determinants are taken, an identity is obtained for the rho function (a certain product of the Mo bius and beta functions)

Lê Numbers of Arrangements and Matroid I

Lê Numbers of Arrangements and Matroid Identities

✍ David B Massey; Rodica Simion; Richard P Stanley; Dirk Vertigan; Dominic J.A Wel 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 324 KB

## dedicated to professor w. t. tutte on the occasion of his eightieth birthday We present several new polynomial identities associated with matroids and geometric lattices and relate them to formulas for the characteristic polynomial and the Tutte polynomial. The identities imply a formula for th

On matroid connectivity

✍ James Oxley; Haidong Wu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 138 KB

If M is a loopless matroid in which MIX and MI Y are connected and X c~ Y is non-empty, then one easily shows that MI(X u Y) is connected. Likewise, it is straightforward to show that if G and H are n-connected graphs having at least n common vertices, then G u H is nconnected. The purpose of this n

Theorems on matroid connectivity

✍ T. Inukai; L. Weinberg 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 135 KB

A note on nongraphic matroids

✍ Takao Asano; Takao Nishizeki; P.D Seymour 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 190 KB

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.