𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On some algorithmic problems of multicriterion optimization on graphs

✍ Scribed by V.A. Emelichev; V.A. Perepelitsa

Publisher
Elsevier Science
Year
1989
Weight
983 KB
Volume
29
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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