We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
Daniel Johannsen, Michael Krivelevich, Wojciech Sa...
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...