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

doi:10.37236/10424

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 journal › Article › peer-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 O_t(n²) and that the total number of hyperedges is bounded by O(n³). Both bounds are tight.

Original language	English
Article number	P3.25
Journal	Electronic Journal of Combinatorics
Volume	29
Issue number	3
DOIs	https://doi.org/10.37236/10424
State	Published - 1 Jan 2022
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.37236/10424

Cite this

@article{5446185b519e46bbb2425cadef161397,

title = "On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs",

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.",

author = "Chaya Keller and Bal{\'a}zs Keszegh and D{\"o}m{\"o}t{\"o}r P{\'a}lv{\"o}lgyi",

note = "Publisher Copyright: {\textcopyright} The authors.",

year = "2022",

month = jan,

day = "1",

doi = "10.37236/10424",

language = "English",

volume = "29",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "3",

}

TY - JOUR

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

AU - Keller, Chaya

AU - Keszegh, Balázs

AU - Pálvölgyi, Dömötör

PY - 2022/1/1

Y1 - 2022/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85135173410&partnerID=8YFLogxK

U2 - 10.37236/10424

DO - 10.37236/10424

M3 - Article

AN - SCOPUS:85135173410

SN - 1077-8926

VL - 29

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 3

M1 - P3.25

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this