✦ LIBER ✦

Equicardinal matroids

✍ Scribed by U.S.R Murty

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 344 KB
Volume: 11
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90021-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning regular graphs into equicar

Partitioning regular graphs into equicardinal linear forests

✍ R.E.L. Aldred; Bill Jackson; Dingjun Lou; Akira Saito 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 521 KB

components are paths.

Coloring matroids

✍ Raul Cordovil 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 367 KB

Consider a simple matroid M(E) with rank r = 3. We prove that there is no partition E = E1uE2 such that, for every line i of M, at least one of the sets lnEl or lnEz is a singleton. A natural generalization of this result to higher ranks is considered.

Symmetric matroids

✍ Gil Kalai 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 621 KB

Orthogonal Matroids

✍ Z.-X. Wan 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 102 KB

Matroid inequalities

✍ Manoj K. Chari 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 188 KB

An important enumerative invariant of a matroid M of rank d is its h-vector defined as (ho, hi ..... ha), where h~ is the coefficient ofx d-i in the polynomial T(M; x, 1), where T(M; x, y) is the Tutte polynomial of M [3]. We refer to Bj6rner's chapter [1] and to [4] for a comprehensive discussion o

Matroidal games

✍ K. G. Ramamurthy; T. Parthasarathy 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 417 KB