Counting Connected Graphs and Hypergraphs via the Probabilistic Method

Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani. Counting Connected Graphs and Hypergraphs via the Probabilistic Method. In Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron, editors, Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Compu. Volume 3122 of Lecture Notes in Computer Science, pages 322-333, Springer, 2004. [doi]

Authors

Amin Coja-Oghlan

This author has not been identified. Look up 'Amin Coja-Oghlan' in Google

Cristopher Moore

This author has not been identified. Look up 'Cristopher Moore' in Google

Vishal Sanwalani

This author has not been identified. Look up 'Vishal Sanwalani' in Google