##
**Zentralblatt MATH**

**Publications of (and about) Paul Erdös**

**Zbl.No: ** 467.05038

**Autor: ** Chinn, P.Z.; Chung, F.R.K.; Erdös, Paul; Graham, Ronald L.

**Title: ** On the bandwidths of a graph and its complement. (In English)

**Source: ** The theory and applications of graphs; 4th int. Conf., Kalamazoo/Mich. 1980, 243-253 (1981).

**Review: ** [For the entire collection see Zbl 459.00006.]

In this paper it is shown that the bandwidth of a graph on m vertices and that of its complement sum to at least n-2 and at most 2n-c log n. Other proofs of the former, or of an equivalent result are also given by Milner and Sauer and by *J.Kahn* and the reviewer [Discrete Math. 33, 323-325 (1981; Zbl 451.05039)]

**Reviewer: ** D.J.Kleitman

**Classif.: ** * 05C35 Extremal problems (graph theory)

**Keywords: ** bandwidth of a graph

**Citations: ** Zbl.459.00006; Zbl.451.05039

© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag