✦ LIBER ✦

Extremal broadcasting problems

✍ Scribed by Roger Labahn

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 915 KB
Volume: 23
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(89)90024-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Limit extremal problems

✍ Yu. M. Ermol'ev; E. A. Nurminskii 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 202 KB

Problems of extremal decomposition

✍ E. G. Emel'yanov 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 735 KB

On extremal decomposition problems

✍ V. N. Dubihin; D. A. Kirillova 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 241 KB

Digraph extremal problems, hypergraph ex

Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures

✍ W.G Brown; M Simonovits 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 747 KB

We consider extremal problems 'of Tur~ type' for r-uniform ordered hypergraphs, where multiple oriented edges are permitted up to multiplicity q. With any such '(r, q)-graph' G" we associate an r-linear form whose maximum over the standard (n -1)-simplex in R" is called the (graph-) density g(G ") o

Problems and prospects for educational d

Problems and prospects for educational direct broadcasting

✍ Ralph Chipman 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 413 KB

Extremal problems involving neighborhood

Extremal problems involving neighborhood unions

✍ Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Richard H. Schelp 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 393 KB

We examine several extremal problems for graphs satisfying the property JN(x) u N(y)l ? s f o r every pair of nonadjacent vertices x , y E V ( G ) . In particular, values for s are found that ensure that the graph contains an s-matching, a 1-factor, a path of a specific length, or a cycle of a spec