On the number of hyperedges in the hypergraph of lines and pseudo-discs

preprint2022arXivOpen access

Abstract

Consider the hypergraph whose vertex set is a family of nn 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 tt-hyperedges is bounded by Ot(n2)O_t(n^2) and that the total number of hyperedges is bounded by O(n3)O(n^3). Both bounds are tight.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.