Let X be the random variable that counts the number of triangles in the binomial random graph G(n, p). We show that for some positive constant c, the probability that X deviates f...
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...