✦ LIBER ✦

Turán type problems on mean convergence. II

✍ Scribed by P. Vértesi

Publisher: Akadmiai Kiad
Year: 1994
Tongue: English
Weight: 226 KB
Volume: 65
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01875151

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Turán type problems on mean convergence.

Turán type problems on mean convergence. I (lagrange type interpolations)

✍ P. Vértesi 📂 Article 📅 1994 🏛 Akadmiai Kiad 🌐 English ⚖ 957 KB

A problem of P. Turán (on the mean conve

A problem of P. Turán (on the mean convergence of lacunary interpolation

✍ P. O. H. Vértesi 📂 Article 📅 1975 🏛 Akadmiai Kiad 🌐 English ⚖ 388 KB

On a Ramsey-Turán type problem

✍ Béla Bollobás; Paul Erdös 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 128 KB

On Ramsey-Turán type problems in tournam

On Ramsey-Turán type problems in tournaments

✍ A Bialostocki; N Sauer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 467 KB

Let Tbe a tournament and let c :e(T)--> {1 ..... r} be an r-colouring of the edges of T. The associated reachability graph, denoted by R(T, c) is a directed graph whose vertices are the vertices of T, and a vertex v of R(T, c) dominates a vertex u of R(T, c) iff there is a monochromatic directed pat

On a Turán type problem of Erdös

✍ Zoltán Füredi 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 209 KB

A Turán type problem for interval graphs

✍ Harvey Abbott; Meir Katchalski 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 313 KB

We consider the following analogue of a problem of Turin for interval graphs: Let c = c(n, rn) be the largest integer such that any interval graph with n vertices and at least m edges contains a complete subgraph on c vertices. We determine the value of c(n, m) explicitly.