𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the minimum size of 4-uniform hypergraphs without property

✍ Scribed by Östergård, Patric R.J.

Book ID
121920776
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
208 KB
Volume
163
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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_

On the Degree, Size, and Chromatic Index
On the Degree, Size, and Chromatic Index of a Uniform Hypergraph
✍ Noga Alon; Jeong Han Kim 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 274 KB

Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the maximum degree of a vertex of H. We conjecture that for every =>0, if D is sufficiently large as a function of t, k, and =, then the chromatic index of H is at most (t&1+1Ât+=) D. We prove t