๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Enumeration of hypergraphs. I

โœ Scribed by I. T. Skibenko

Book ID
105057183
Publisher
Springer US
Year
1984
Tongue
English
Weight
431 KB
Volume
20
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Enumeration of hypergraphs
Enumeration of hypergraphs
โœ Malti Hedge; M.R. Sridharan ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 469 KB
Enumeration of Hypergraphs
Enumeration of Hypergraphs
โœ Toru Ishihara ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 87 KB

In this paper, we will study enumeration of hypergraphs. Let S p be a symmetric group acting on a p-setX . It induces the permutation group S \* p acting on the set of all subsets of X . Our problem is reduced to finding a good formula for the cycle index of S \* p . A crucial point is to calculate

Enumeration of hypergraphs. II
Enumeration of hypergraphs. II
โœ I. T. Skibenko ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Springer US ๐ŸŒ English โš– 897 KB
Enumeration of Maximum Acyclic Hypergrap
Enumeration of Maximum Acyclic Hypergraphs
โœ Jian-fang Wang; Hai-zhu Li ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Institute of Applied Mathematics, Chinese Academy ๐ŸŒ English โš– 97 KB