✦ LIBER ✦

Sperner Matroid

✍ Scribed by Shyh-Nan Lee; Mau-Hsiang Shih

Publisher: Springer
Year: 2003
Tongue: English
Weight: 121 KB
Volume: 81
Category: Article
ISSN: 0003-889X
DOI: 10.1007/s00013-003-0528-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sperner capacities

✍ L. Gargano; J. Körner; U. Vaccaro 📂 Article 📅 1993 🏛 Springer Japan 🌐 English ⚖ 626 KB

Ramsey–Sperner theory

✍ Zoltán Füredi; Jerrold R. Griggs; Andrew M. Odlyzko; James B. Shearer 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 667 KB

Let [n] denote the n-set {1,2, . . . , n}, let k, 12 1 be integers. Define fi(n, k) as the minimum number f such that for every family F c 2'"' with (F( > f, for every k-coloring of [n], there exists a chain A, E. . . f Al+, in F in which the set of added elements, AI+l-A1, is monochromatic. We sur

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

On counting Sperner families

✍ Raymond Balbes 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 405 KB

A sperner-type theorem

✍ Attila Sali 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 225 KB

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