Counting dense connected hypergraphs via the probabilistic method-Reference-Cited by-同舟云学术

Counting dense connected hypergraphs via the probabilistic method

Published:2018-02-13 Issue:2 Volume:53 Page:185-220
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct Alg

Author:

Bollobás Béla¹²³,Riordan Oliver⁴

Affiliation:

1. Department of Pure Mathematics and Mathematical StatisticsUniversity of CambridgeUnited Kingdom

2. Department of Mathematical SciencesUniversity of MemphisMemphisTennessee

3. London Institute for Mathematical SciencesLondonUnited Kingdom

4. Mathematical Institute, University of Oxford, OxfordUnited Kingdom

Funder

NSF

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/rsa.20762

Reference11 articles.

1. T.AndriamampianinaandV.Ravelomanana Enumeration of connected uniform hypergraphs Proceedings of 17th International Conference on Formal Power Series and Algebraic Combinatorics Taormina (FPSAC 2005) 2005 pp. 387–398.

2. Branching Processes

3. The order of the giant component of random hypergraphs;Behrisch M.;Random Struct. Algorithms

4. Local Limit Theorems for the Giant Component of Random Hypergraphs

5. ‘The Asymptotic Number of Connected d-Uniform Hypergraphs’ — CORRIGENDUM

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes;The Electronic Journal of Combinatorics;2022-07-29

2. Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges;Electronic Notes in Theoretical Computer Science;2019-08