✦ LIBER ✦

An Extremal Problem on Degree Sequences of Graphs

✍ Scribed by Nathan Linial; Eyal Rozenman

Book ID: 106048131
Publisher: Springer Japan
Year: 2002
Tongue: English
Weight: 116 KB
Volume: 18
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730200041

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extreme degree sequences of simple graph

Extreme degree sequences of simple graphs

✍ Michael Koren 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 501 KB

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

An extremal problem on group connectivit

An extremal problem on group connectivity of graphs

✍ Rong Luo; Rui Xu; Gexin Yu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 243 KB

An extremal problem on the connectivity

An extremal problem on the connectivity of graphs

✍ Qi-Mei He 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB

An extremal problem for 3-graphs

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

An extremal problem in geodetic graphs

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