✦ LIBER ✦

A deletion game on hypergraphs

✍ Scribed by Aviezri S. Fraenkel; Edward R. Scheinerman

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 477 KB
Volume: 30
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(91)90041-t

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On a class of balanced hypergraphs

✍ András Frank 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 986 KB

Let P be nn arborcscencc, and let F, = {U,, , I/, ). F, = { \y,, . . , V, } bc two systems consisting of directed s&paths of P. MIntmax theorems and algorithms UC proved concerning the so called bi-pcrth system (P; F,,. F, ). One can define a hypqraph to every hi-path system. The class of t hcsc "Ri

A Theorem on Pure States on a Hypergraph

✍ Peter G. Ovchinnikov 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

A note on node packing polytopes on hype

A note on node packing polytopes on hypergraphs

✍ Yasuki Sekiguchi 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 524 KB

On the cyclomatic number of a hypergraph

✍ B.D. Acharya 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 572 KB

## This note generalizes the notion of cyclomatic number (or cycle rank) from Graph Theory to Hypergraph Theory and links it up with the concept of planarity in hypergraphs which was recently introducea by R.P. Jones. Sharp bounds are obtained for the cyclomatic number of the planar hypergraphs an

A note on hypergraphs with the Helly-pro

A note on hypergraphs with the Helly-property

✍ A. Gyárfás 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Receixed 10 October b)77 Revised 23 May lt-7S l.et bl bca t,,yperoraph and g a natural mmff-'cr. The sets <high can be wriiven as the .miot~ of t dilIere ~l edges of H fc, ml a ~ew hypergraph which is denoted by HL Let us suppose hint H has; 01e H( lly prope~ ty end we want to state something simila