On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs

Chaya Keller, Balázs Keszegh, Dömötör Pálvölgyi

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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 languageEnglish
Article numberP3.25
JournalElectronic Journal of Combinatorics
Volume29
Issue number3
DOIs
StatePublished - 2022

Fingerprint

Dive into the research topics of 'On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs'. Together they form a unique fingerprint.

Cite this