✦ LIBER ✦

Extremal graphs for weights

✍ Scribed by Béla Bollobás; Paul Erdös; Amites Sarkar

Book ID: 104114218
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 530 KB
Volume: 200
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00320-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal graphs for homomorphisms

✍ Jonathan Cutler; A. J. Radcliffe 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

The study of graph homomorphisms has a long and distinguished history, with applications in many areas of graph theory. There has been recent interest in counting homomorphisms, and in particular on the question of finding upper bounds for the number of homomorphisms from a graph G into a fixed imag

Extremal problems for directed graphs

✍ W.G Brown; P Erdös; M Simonovits 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 858 KB

Extremal subgraphs for two graphs

✍ F.R.K Chung; P Erdös; J Spencer 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 564 KB

Extremal graphs for intersecting cliques

✍ Guantao Chen; Ronald J. Gould; Florian Pfender; Bing Wei 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 156 KB

Extremal Graphs for Intersecting Triangl

Extremal Graphs for Intersecting Triangles

✍ P. Erdos; Z. Furedi; R.J. Gould; D.S. Gunderson 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 400 KB

It is known that for a graph on \(n\) vertices \(\left\lfloor n^{2} / 4\right\rfloor+1\) edges is sufficient for the existence of many triangles. In this paper, we determine the minimum number of edges sufficient for the existence of \(k\) triangles intersecting in exactly one common vertex. C 1995

Extremal -stable graphs

✍ Illés Horváth; Gyula Y. Katona 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 228 KB