𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Stéphanie Conilh

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
230 KB
Volume
70
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Note on hypergraphs and sphere orders
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

On line graphs of linear 3-uniform hyper
On line graphs of linear 3-uniform hypergraphs
✍ Metelsky, Yury; Tyshkevich, Regina 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

It is known that the class of line graphs of linear 3-uniform hypergraphs cannot be characterized by a finite list of forbidden induced subgraphs (R. N.

On a question of Sós about 3-uniform fri
On a question of Sós about 3-uniform friendship hypergraphs
✍ Stephen G. Hartke; Jennifer Vandenbussche 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

## Abstract The well‐known Friendship Theorem states that if __G__ is a graph in which every pair of vertices has exactly one common neighbor, then __G__ has a single vertex joined to all others (a “universal friend”). V. Sós defined an analogous friendship property for 3‐uniform hypergraphs, and g

On topological tournaments of order 4 in
On topological tournaments of order 4 in digraphs of outdegree 3
✍ Mader, W. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 371 KB 👁 1 views

It is proved that every finite digraph of minimum outdegree 3 contains a subdivision of the transitive tournament on 4 vertices.