𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Realizing degree sequences with -edge-connected uniform hypergraphs

✍ Scribed by Gu, Xiaofeng; Lai, Hong-Jian

Book ID
122355096
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
478 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

On existence of hypergraphs with prescri
On existence of hypergraphs with prescribed edge degree profile
✍ Mirko HorňÑk; Rudolf Lauff; Roman SotΓ‘k πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 518 KB

The degree profile of an edge e of a finite hypergraph H is the map assigning to a positive integer i the number of vertices of degree i incident with e. The edge degree profile of H is the map describing for any possible degree profile ~ the number of edges in H with degree profile ~. A necessary a