Author:
Aronshtam Lior,Linial Nathan,Łuczak Tomasz,Meshulam Roy
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference7 articles.
1. Aronshtam, L., Linial, N.: When does the top homology of a random simplicial complex vanish? arXiv:1203.3312
2. Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. Wiley-Intescience, New York (2000)
3. Cohen, D., Costa, A., Farber, M., Kappeler, T.: Topology of random 2-complexes. Discrete Comput. Geom. 47, 117–149 (2012)
4. Kozlov, D.: The threshold function for vanishing of the top homology group of random d complexes. Proc. Am. Math. Soc. 138, 4517–4527 (2010)
5. Łuczak, T.: Size and connectivity of the k-core of a random graph. Discret. Math. 91, 61–68 (1991)
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献