𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-connectivity of permutation hypergraphs

✍ Scribed by Neil Jami; Zoltán Szigeti

Book ID
113567414
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
217 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge splitting and connectivity augmenta
Edge splitting and connectivity augmentation in directed hypergraphs
✍ Alex R. Berg; Bill Jackson; Tibor Jordán 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 262 KB

We prove theorems on edge splittings and edge-connectivity augmentation in directed hypergraphs, extending earlier results of Mader and Frank, respectively, on directed graphs.

The number of connected sparsely edged u
The number of connected sparsely edged uniform hypergraphs
✍ Michakl Karoński; Tomasz kLuczak 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 684 KB

Certain families of d-uniform hypergraphs are counted. In particular, the number of connected d-uniform hypergraphs with r vertices and r + k hyperedges, where k = o(log r/log tog r), is found.

Scrambling permutations and entropy of h
Scrambling permutations and entropy of hypergraphs
✍ Zoltán Füredi 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 385 KB

The following result is proved by using entropy of hypergraphs. If r , , . . . , r,, are permutations of the n element set P such that for every triple x , y , z E P, one can find a ri such that ~~( x ) is between r i ( y ) and r i ( z ) , then n < exp(d/2). We also study k-scrambling permutations.