✦ LIBER ✦

On shift stable hypergraphs

✍ Scribed by Endre Boros

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 219 KB
Volume: 87
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90073-b

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Turan hypergraphs

✍ M. Lorea 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 466 KB

Let a(H) be the -,t\*rbility number of a hypergraph H = (X, a). T(n, L, ar) is the smallest 4 such that there exists :'. k-uniform hypergraph H with n vertices, 4 edges and with a(H) s Q. A k-uniform hypergraph H, with n vertices, T( n, k, cr ) edges and Q!(H) s ~1 is a Turan hypergraph. The value

On unavoidable hypergraphs

✍ F. R. K. Chung; P. Erdös 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 518 KB

Observables on hypergraphs

✍ S. P. Gudder; G. T. Rüttimann 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 834 KB

Satisfiability on hypergraphs

✍ Adam Kolany 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 557 KB

On decomposing a hypergraph into k conne

On decomposing a hypergraph into k connected sub-hypergraphs

✍ András Frank; Tamás Király; Matthias Kriesell 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 159 KB

By applying the matroid partition theorem of J. Edmonds (J. Res. Nat. Bur. Standards Sect. B 69 (1965) 67) to a hypergraphic generalization of graphic matroids, due to Lorea (Cahiers Centre Etudes Rech. Oper. 17 (1975) 289), we obtain a generalization of Tutte's disjoint trees theorem for hypergraph

A deletion game on hypergraphs

✍ Aviezri S. Fraenkel; Edward R. Scheinerman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 477 KB