𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extremal problems in graph theory

✍ Scribed by Béla Bollobás

Publisher
John Wiley and Sons
Year
1977
Tongue
English
Weight
304 KB
Volume
1
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The aim of this note is to give an account of some recent results and state a number of conjectures concerning extremal properties of graphs.

📜 SIMILAR VOLUMES

Some problems in topological graph theor
Some problems in topological graph theory
✍ Jonathan L. Gross; Frank Harary 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English

## Abstract A list of 31 problems presented here reflects some of the main trends in topological graph theory.

Open problems of Paul Erd�s in graph the
Open problems of Paul Erd�s in graph theory
✍ Chung, F. R. K. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB 👁 1 views

The main treasure that Paul Erdős has left us is his collection of problems, most of which are still open today. These problems are seeds that Paul sowed and watered by giving numerous talks at meetings big and small, near and far. In the past, his problems have spawned many areas in graph theory an

An extremal bandwidth problem for bipart
An extremal bandwidth problem for bipartite graphs
✍ Robert C. Brigham; Julie R. Carrington; Ronald D. Dutton; Joseph Fiedler; Richar 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB 👁 2 views
An extremal problem on Kr-free graphs
An extremal problem on Kr-free graphs
✍ Peter Frankl; János Pach 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 2 views

Let r, t 2 2 be integers and c a constant, 0 < c 5 ( r -2 ) / ( r -1). Suppose that G is a &-free graph on n vertices in which any t distinct vertices have at most cn common neighbors. Here an asymptotically best bound is obtained for the maximal number of edges in such graphs. This solves a problem