In this paper, we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for ...

Edge colouring is a fundamental concept in graph theory whereby colours are assigned to the edges of a graph such that no two adjacent edges share the same colour. This process is central to numerous ...

This is a preview. Log in through your library . Abstract In a random graph, counts for the number of vertices with given degrees will typically be dependent. We show via a multivariate normal and a ...