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

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the number of hyperedges in the hypergraph of lines and pseudo-discs
scientific article

    Statements

    On the number of hyperedges in the hypergraph of lines and pseudo-discs (English)
    0 references
    0 references
    0 references
    0 references
    4 August 2022
    0 references
    Summary: 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^2)\) and that the total number of hyperedges is bounded by \(O(n^3)\). Both bounds are tight.
    0 references
    VC-dimension
    0 references
    3-hyperedges
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references