Abstract
Consider a hypergraph whose vertex set is a family of n lines in general position in the plane, and whose hyperedges are induced by intersections with a family of pseudo-discs. We prove that the number of t-hyperedges is bounded by Ot(n2) and that the total number of hyperedges is bounded by O(n3). Both bounds are tight.
Original language | English |
---|---|
Article number | P3.25 |
Journal | Electronic Journal of Combinatorics |
Volume | 29 |
Issue number | 3 |
DOIs | |
State | Published - 2022 |