Extremal problems for geometric hypergraphs (Q1389166): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q199001 |
||
| Property / reviewed by | |||
| Property / reviewed by: Vladimir D. Tonchev / rank | |||
Revision as of 16:43, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extremal problems for geometric hypergraphs |
scientific article |
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
