✦ LIBER ✦

Note on hypergraphs and sphere orders

✍ Scribed by Alexander Schrijver

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 163 KB
Volume: 17
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190170206

No coin nor oath required. For personal study only.

✦ Synopsis

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 case k = 2. © 1993 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

A note on graphs and sphere orders

✍ Edward R. Scheinerman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract A partially ordered set __P__ is called a __k‐sphere order__ if one can assign to each element a ∈ __P__ a ball __B__~__a__~ in __R^k^__ so that __a__ < __b__ iff __B__~__a__~ ⊂ __B__~__b__~. To a graph __G__ = (__V,E__) associate a poset __P__(__G__) whose elements are the vertices and

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 vertex orders for stability nu

A note on vertex orders for stability number

✍ Mahadev, N. V. R.; Reed, B. A. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 2 views

We investigate vertex orders that can be used to obtain maximum stable sets by a simple greedy algorithm in polynomial time in some classes of graphs. We characterize a class of graphs for which the stability number can be obtained by a simple greedy algorithm. This class properly contains previousl

Note on the drag coefficient for a spher

Note on the drag coefficient for a sphere

✍ Scott W. Hopke; John C. Slattery 📂 Article 📅 1970 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 191 KB 👁 2 views

On unavoidable hypergraphs

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

High order integration schemes on the un

High order integration schemes on the unit sphere

✍ Delley, Bernard 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 395 KB 👁 1 views

A method for refining high order numerical integration schemes is described. Particular focus is on integration schemes over the unit sphere with octahedral symmetry. The method is powerful enough that new integration schemes can be found from rough intuitive guesses. New schemes up to order 59 are