✦ LIBER ✦

The Clique Complex and Hypergraph Matching

✍ Scribed by Roy Meshulam

Publisher: Springer-Verlag
Year: 2001
Tongue: English
Weight: 161 KB
Volume: 21
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s004930170006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the fractional matching polytope of a

On the fractional matching polytope of a hypergraph

✍ Z. Füredi; J. Kahn; P. D. Seymour 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 490 KB

Partial Steiner systems and matchings in

Partial Steiner systems and matchings in hypergraphs

✍ A.V. Kostochka; V. Rödl 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 203 KB

For tk, a t, k T-system is a k-uniform hypergraph H such that any two Ž . distinct edges of H have at most t y 1 vertices in common. Clearly, any t, k -system on n n k

2-Matchings and 2-covers of hypergraphs

✍ L. Lovász 📂 Article 📅 1975 🏛 Akadmiai Kiad 🌐 English ⚖ 754 KB

Weighted fractional and integral k-match

Weighted fractional and integral k-matching in hypergraphs

✍ Anand Srivastav; Peter Stangier 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 712 KB

The Hilbert Series of the Clique Complex

✍ Daniela Ferrarello; Ralf Fröberg 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 89 KB

Matchings and transversals in hypergraph

Matchings and transversals in hypergraphs, domination and independence-in trees

✍ E.J Cockayne; S.T Hedetniemi; P.J Slater 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 199 KB