The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph

Addendum to “The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph”

Random Structures & Algorithms

The Expected Length of a Minimal Spanning Tree of a Cylinder Graph

Combinatorics, Probability and Computing

On an Online Spanning Tree Problem in Randomly Weighted Graphs

Combinatorics, Probability and Computing

The weight of the shortest path tree

Random Structures & Algorithms

Counting connected graphs and hypergraphs via the probabilistic method

Random Structures & Algorithms

Local Limit Theorems for the Giant Component of Random Hypergraphs

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques

On the difference of expected lengths of minimum spanning trees

Combinatorics, Probability and Computing

The order of the giant component of random hypergraphs

Random Structures & Algorithms