𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Subhypergraph counts in extremal and random hypergraphs and the fractionalq-independence

✍ Scribed by Andrzej Dudek; Joanna Polcyn; Andrzej Ruciński

Publisher
Springer US
Year
2008
Tongue
English
Weight
417 KB
Volume
19
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the random generation and counting of
On the random generation and counting of matchings in dense graphs
✍ J. Diaz; M. Serna; P. Spirakis 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 628 KB

In this work we present a fully randomized approximation scheme for counting the number of perfect matchings in a dense bipartite graphs, that is equivalent to get a fully randomized approximation scheme to the permanent of a dense boolean matrix. We achieve this known solution, through novel extens

On the asymptotic distributions of subgr
On the asymptotic distributions of subgraph counts in a random tournament
✍ Pontus Andersson 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB 👁 2 views

A random tournament T is obtained by independently orienting the edges of n 1 the complete graph on n vertices, with probability for each direction. We study the 2 asymptotic distribution, as n tends to infinity, of a suitable normalization of the number of subgraphs of T that are isomorphic to a gi