Extremal problems for geometric hypergraphs (Q1389166)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1164314
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extremal problems for geometric hypergraphs |
scientific article; zbMATH DE number 1164314 |
Statements
Extremal problems for geometric hypergraphs (English)
0 references
11 June 1998
0 references
Bounds for the largest number of edges (\(i\)-simplices) in a geometric hypergraph with forbidden configurations such as intersecting edges, crossing edges, pairwise crossing edges, etc., are derived. Some of the bounds are tight.
0 references
geometric hypergraph
0 references
crossing
0 references
bounds
0 references
0.7941150665283203
0 references
0.7874820828437805
0 references
