✦ LIBER ✦

Constructible hypergraphs

✍ Scribed by Christian Schindler

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 661 KB
Volume: 91
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90109-f

No coin nor oath required. For personal study only.

✦ Synopsis

The class A of finite manuals (i.e. hypergraphs formed by the cliques of finite graphs) is closed under the formation of sums and products. We define the class of constructible hypergraphs to be the smallest subclass of A which contains all finite classical manuals (i.e. hypergraphs having a single edge) and is closed under the formation of sums and products. Constructible hypergraphs have two interesting properties: (1) they do not contain hooks and (2) all their minimal transversals are supports of dispersion-free stochastic functions. Property (1) is known to characterize the constructible members of A. In this paper we show that the same holds true for property (2).

📜 SIMILAR VOLUMES

Constructing regular self-complementary

Constructing regular self-complementary uniform hypergraphs

✍ Shonda Gosselin 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB 👁 1 views

In this article, we examine the possible orders of t-subset-regular selfcomplementary k-uniform hypergraphs, which form examples of large sets of two isomorphic t-designs. We reformulate Khosrovshahi and Tayfeh-Rezaie's necessary conditions on the order of these structures in terms of the binary rep

Constructing isospectral non-isomorphic

Constructing isospectral non-isomorphic digraphs from hypergraphs

✍ Barry Balof; Christopher Storm 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract We explore the “oriented line graph” construction associated with a hypergraph, leading to a construction of pairs of strongly connected directed graphs whose adjacency operators have the same spectra. We give conditions on a hypergraph so that a hypergraph and its dual give rise to iso

An algorithm for constructing edge-trees

An algorithm for constructing edge-trees from hypergraphs

✍ Fǎnicǎ Gavril; Robert Tamari 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 628 KB

Hierarchies of constructible sets

✍ Keith J. Devlin 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 413 KB

Operations on constructible functions

✍ Pierre Schapira 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 996 KB

Interval hypergraphs and D-interval hype

Interval hypergraphs and D-interval hypergraphs

✍ John I. Moore Jr. 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 449 KB

A hypcrgraph H = ( ~,; g) is called an inler,, d hypergraph if there exists a one-try-one functio,~ [ mapping the elements of V h:~ points on the real line such that for each edge E, there is an interval !, containing the images of all elements of E, but not the images of any elements not in E,. The