𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extremal hypergraph problems and convex hulls

✍ Scribed by Péter L. Erdős; G. O. H. Katona; P. Frankl

Book ID
110564477
Publisher
Springer-Verlag
Year
1985
Tongue
English
Weight
619 KB
Volume
5
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Extremal Approximately Convex Functions
Extremal Approximately Convex Functions and Estimating the Size of Convex Hulls
✍ S.J. Dilworth; Ralph Howard; James W. Roberts 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 540 KB

A real-valued function f defined on a convex set K is an approximately convex function iff it satisfies A thorough study of approximately convex functions is made. The principal results are a sharp universal upper bound for lower semi-continuous approximately convex functions that vanish on the ver