𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a valence problem in extremal graph theory

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

Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
936 KB
Volume
5
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal problems in graph theory
Extremal problems in graph theory
✍ Béla Bollobás 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## 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.

A retraction problem in graph theory
A retraction problem in graph theory
✍ Alain Quilliot 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 563 KB

Given two graphs G=(X,E), H=(Y,F); If AcX and if f is a function from A to Y, we pose the problem of deciding if f can be extended into a homomorphism from G to H. We know how to solve this problem when H is, for instance, a tree, or a chordal graph. We give here a solution to this problem when g is

On some extremal problems on r-graphs
On some extremal problems on r-graphs
✍ P. Erdös 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 499 KB

Abslract. Denote by @)(n; k) an ~-graph of n vcrtieca and k r-tuples. Turin's classical problem states: Detomline the smailcst integer f(n;r, I) so that cvcry G%; f(n; r, I)) contains a K@)(I). Tur&n determined f (n; r, I) for r = 2, but nothing is known for r > ?. Put lim,,f(n; t, O/(y) = c,,~ The