In 1959 Read [6] determined an exact formula for the number of labelled ..1-regular graphs on n vertices. This formula, whose proof is based on P6lya's enumeration theorem [5], is not easily… (More)

The ‘classical’ random graph models, in particular G(n, p), are ‘homogeneous’, in the sense that the degrees (for example) tend to be concentrated around a typical value. Many graphs arising in the… (More)

Recently, Barabási and Albert [2] suggested modeling complex real-world networks such as the worldwide web as follows: consider a random graph process in which vertices are added to the graph one at… (More)

We consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number m of earlier vertices, where each earlier vertex is chosen with probability… (More)

Recently there has been much interest in studying large-scale real-world networks and attempting to model their properties using random graphs. Although the study of real-world networks as graphs… (More)

Let G1 and GS be graphs with n vertices. If there are edge-disjoint copies of G1 and G, with the same n vertices, then we say there is a packing of G, and Ge . This paper is concerned with… (More)

We present a few results and a larger number of questions concerning partitions of graphs or hypergraphs, where the objective is to maximize or minimize several quantities simultaneously. We consider… (More)