𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extremal Problems for Geometric Hypergraphs

✍ Scribed by T. K. Dey; J. Pach

Publisher
Springer
Year
1998
Tongue
English
Weight
128 KB
Volume
19
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Extremal Problems for Sets Forming Boole
Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs
✍ David S. Gunderson; VojtΔ›ch RΓΆdl; Alexander Sidorenko πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 209 KB

Three classes of finite structures are related by extremal properties: complete d-partite d-uniform hypergraphs, d-dimensional affine cubes of integers, and families of 2 d sets forming a d-dimensional Boolean algebra. We review extremal results for each of these classes and derive new ones for Bool

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 problems concerning transformat
Extremal problems concerning transformations of the edges of the complete hypergraphs
✍ Yair Caro πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 456 KB

We consider extremal problems concerning transformations of the edges of complete hypergraphs. We estimate the order of the largest subhypergraph K such that for every edge e E €(K), f(e) e f ( K ) , assuming f(e) # e. Several extensions and variations of this problem are also discussed here.