Εμφανίζονται 1 - 10 Αποτελέσματα από 10 για την αναζήτηση '"pseudo-segments"', χρόνος αναζήτησης: 0,77δλ Περιορισμός αποτελεσμάτων
  1. 1
  2. 2
    Academic Journal
  3. 3
    Academic Journal

    Συγγραφείς: Fox, Jacob, Pach, János, Suk, Andrew

    Συνεισφορές: Jacob Fox and János Pach and Andrew Suk

    Θεματικοί όροι: Enumeration, intersection graphs, pseudo-segments, x-monotone

    Περιγραφή αρχείου: application/pdf

    Relation: Is Part Of LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.4

  4. 4
    Academic Journal

    Συγγραφείς: Fox, Jacob, Pach, János, Suk, Andrew

    Συνεισφορές: Jacob Fox and János Pach and Andrew Suk

    Θεματικοί όροι: Regularity lemma, pseudo-segments, intersection graphs

    Περιγραφή αρχείου: application/pdf

    Relation: Is Part Of LIPIcs, Volume 293, 40th International Symposium on Computational Geometry (SoCG 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.59

  5. 5
    Academic Journal

    Συγγραφείς: Fox, J., Pach, János, Suk, A.

    Συνεισφορές: Jacob Fox and János Pach and Andrew Suk

    Περιγραφή αρχείου: application/pdf; text

  6. 6
  7. 7
    Academic Journal
  8. 8
  9. 9
    Mixed Materials

    Additional Titles: A curve in the plane is x-monotone if every vertical line intersects it at most once. A family of curves are called pseudo-segments if every pair of them have at most one point in common. We construct 2^Ω(n^{4/3}) families, each consisting of n labelled x-monotone pseudo-segments such that their intersection graphs are different. On the other hand, we show that the number of such intersection graphs is at most 2^O(n^{3/2-ε}), where ε > 0 is a suitable constant. Our proof uses an upper bound on the number of set systems of size m on a ground set of size n, with VC-dimension at most d. Much better upper bounds are obtained if we only count bipartite intersection graphs, or, in general, intersection graphs with bounded chromatic number.

    Σύνδεσμος: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.4
    Is Part Of LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)

  10. 10