𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On unavoidable hypergraphs

✍ Scribed by F. R. K. Chung; P. Erdös

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
518 KB
Volume
11
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On avoidable and unavoidable trees
On avoidable and unavoidable trees
✍ Xiaoyun Lu 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 574 KB

A directed tree is a rooted tree if there is one vertex (the root) of in-degree 0 and every other vertex has in-degree 1. The depth of a rooted tree is the length of a longest path from the root. A directed graph G is called n-unavoidable if every tournament of order n contains it as a subgraph. M.

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 the minimum size of tight hypergraphs
On the minimum size of tight hypergraphs
✍ Jorge L. Arocha; Javier Bracho; Victor Neumann-Lara 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 333 KB

## Abstract A __k__‐graph, __H__ = (__V, E__), is __tight__ if for every surjective mapping __f__: __V__ → {1,….k} there exists an edge α ϵ __E__ sicj tjat __f__|~α~ is injective. Clearly, 2‐graphs are tight if and only if they are connected. Bounds for the minimum number ϕ of edges in a tight __k_