# Béla Bollobás

- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from

**public sources and our publisher partners.**This text is an in-depth account of graph theory. It reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. Recognizing that graph theory is one… Expand

Let Δ and n be natural numbers such that Δn = 2m is even and Δ ⩽ (2 log n )1/2 - 1. Then as n →, the number of labelled Δ-regular graphs on n vertices is asymptotic to e − λ − λ 2 ( 2 m ) ! m ! 2 m (… Expand

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… Expand

Recently, Barabasi 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… Expand

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… Expand

AbstractFor a fixed probabilityp, 0<p<1, almost every random graphGn,p has chromatic number
$$\left( {\frac{1}{2} + o(1)} \right)\log (1/(1 - p))\frac{n}{{\log n}}$$
,

In a supervisory system for detecting abnormal conditions, existing AC electric power supply lines are utilized and a plurality of resonance elements controlled by abnormal condition detectors are… Expand