✦ LIBER ✦

An extremal graph problem

✍ Scribed by P. Erdős; M. Simonovits

Publisher: Akadmiai Kiad
Year: 1972
Tongue: English
Weight: 409 KB
Volume: 22
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01896420

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An extremal problem in geodetic graphs

✍ K.R. Parthasarathy; N. Srinivasan 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 365 KB

An extremal problem for 3-graphs

✍ P. Frankl 📂 Article 📅 1978 🏛 Akadmiai Kiad 🌐 English ⚖ 241 KB

An extremal problem for the spectral rad

An extremal problem for the spectral radius of a graph

✍ Miroslav Fiedler 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 519 KB

The extremal graph problem of the icosah

The extremal graph problem of the icosahedron

✍ Simonovits Miklós 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 528 KB

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

✍ 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