Planar point sets determine many pairwise crossing segments (Q2039541)
From MaRDI portal
(Redirected from Item:Q5212855)
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Planar point sets determine many pairwise crossing segments |
scientific article; zbMATH DE number 7160588
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar point sets determine many pairwise crossing segments |
scientific article; zbMATH DE number 7160588 |
Statements
Planar point sets determine many pairwise crossing segments (English)
0 references
5 July 2021
0 references
30 January 2020
0 references
epsilon-nets
0 references
geometric graphs
0 references
crossing families
0 references
avoiding sets
0 references
intersection graphs
0 references
partial orders
0 references
avoiding edges
0 references
comparability graphs
0 references
computational geometry
0 references
crossing edges
0 references
extremal combinatorics
0 references
0 references
0 references
0 references
0.99999994
0 references
0 references
0 references
0.8706732
0 references
0.87054706
0 references
0.8661982
0 references
0.86363304
0 references
0.8622998
0 references
