𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The distribution of the maximum degree of a random graph

✍ Scribed by Béla Bollobás

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
184 KB
Volume
32
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Consider I:andom graphs with n labelled vertices in which the edges are chosen independently and with a 6lxed probability p, 0 <p C 1. Let y be a fixed real number, q = 1p, and denote by A the maximum degree. Then

📜 SIMILAR VOLUMES

The Distribution of the Maximum Vertex D
The Distribution of the Maximum Vertex Degree in Random Planar Maps
✍ Zhicheng Gao; Nicholas C. Wormald 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 297 KB

We determine the limiting distribution of the maximum vertex degree 2 n in a random triangulation of an n-gon, and show that it is the same as that of the maximum of n independent identically distributed random variables G 2 , where G 2 is the sum of two independent geometric(1Â2) random variables.

The irredundance number and maximum degr
The irredundance number and maximum degree of a graph
✍ B. Bollobás; E.J. Cockayne 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 104 KB

A vertex x in a subset X of vertices of an undirected graph is redundant if its dosed neighborhood is contained in the union of closed neighborhoods of vertices of X-{x}. In the context of a communications network, this means that any vertex that may receive communications from X may also be irdorme

The degree sequence of a random graph. I
The degree sequence of a random graph. I. The models
✍ Brendan D. McKay; Nicholas C. Wormald 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 2 views

We show that the joint distribution of the degrees of a random graph can be accurately approximated by several simpler models derived from a set of independent binomial distributions. On the one hand, we consider the distribution of degree sequences of 1 random graphs with n vertices and m edges. Fo

The maximum size of graphs satisfying a
The maximum size of graphs satisfying a degree condition
✍ Yiping Qiu; Xiao Feng Jia 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Let G be a simple graph of order n without isolated vertices. If the integer h satisfies In this note the maximum size of Sri(h)--graphs is determined. A result of Krol and Veldman on critically h-connected graphs follows as a corollary.

The chromatic index of graphs of high ma
The chromatic index of graphs of high maximum degree
✍ K.H. Chew 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 608 KB

In this paper, we give sufficient conditions for simple graphs to be class 1. These conditions mainly depend on the edge-connectivity, maximum degree and the number of vertices of maximum degree of a graph. Using these conditions, we can extend various results of Chetwynd and Hilton, and Niessen and