Abstract
Consider the hypergraph whose vertex set is a family of 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 -hyperedges is bounded by and that the total number of hyperedges is bounded by . Both bounds are tight.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.