✦ LIBER ✦

A note on node packing polytopes on hypergraphs

✍ Scribed by Yasuki Sekiguchi

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 524 KB
Volume: 2
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(83)90032-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on hop-constrained walk polytopes

✍ Geir Dahl; Njål Foldnes; Luis Gouveia 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 194 KB

Note on hypergraphs and sphere orders

✍ Alexander Schrijver 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB

## Abstract We show that each partial order ≤ of height 2 can be represented by spheres in Euclidean space, where inclusion represents ≤. If each element has at most __k__ elements under it, we can do this in 2__k__ − 1‐dimensional space. This extends a result (and a method) of Scheinerman for the

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

A complete description of the traveling

A complete description of the traveling salesman polytope on 8 nodes

✍ Thomas Christof; Michael Jünger; Gerhard Reinelt 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Note on Kocay's 3-Hypergraphs and Stockm

Note on Kocay's 3-Hypergraphs and Stockmeyer's Tournaments

✍ Stéphanie Conilh 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 230 KB

In this note, we study the nonreconstructibility property through examples given by Stockmeyer (for tournaments) and Kocay (for 3-hypergraphs). Relating these examples we show how to obtain non (&1)-reconstructible ternary relations from particular non (&1)-reconstructible binary ones.

A note on an open-end bin packing proble

A note on an open-end bin packing problem

✍ Joseph Y.-T. Leung; Moshe Dror; Gilbert H. Young 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 71 KB 👁 1 views

We consider a variant of the classical one-dimensional bin packing problem, which we call the open-end bin packing problem. Suppose that we are given a list L = (p 1 ; p 2 ; : : : ; pn) of n pieces, where p j denotes both the name and the size of the jth piece in L, and an inÿnite collection of inÿn