Extremal problems for geometric hypergraphs (Q1389166): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q199001 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Vladimir D. Tonchev / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/pl00009365 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024662946 / rank | |||
Normal rank | |||
Latest revision as of 09:06, 30 July 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
