Homological connectedness of random hypergraphs
Authors:
- Oliver CooleyOCOliver Cooley
- Penny HaxellPHPenny Haxell
- Mihyun KangMKMihyun Kang
- Philipp SprüsselPSPhilipp Sprüssel
- 1 August 2017
- journal article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 61, 279-285
Abstract
No abstract availableAll Related Versions
Funding Information
- Austrian Science Fund (P27290, W1230 II)
- NSERC
This publication has 4 references indexed in Scilit:
- Threshold and Hitting Time for High-Order Connectedness in Random HypergraphsThe Electronic Journal of Combinatorics, 2016
- Inside the critical window for cohomology of random k -complexesRandom Structures & Algorithms, 2015
- On the Strength of Connectedness of a Random HypergraphThe Electronic Journal of Combinatorics, 2015
- Homological Connectivity Of Random 2-ComplexesCombinatorica, 2006