-
1Academic Journal
Συγγραφείς: Fox, J., Pach, János, Suk, A.
Συνεισφορές: Jacob Fox and János Pach and Andrew Suk
Πηγή: Journal of Combinatorial Theory, Series B. 174:99-132
Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, QA Mathematics / matematika, intersection graph, Graph representations (geometric and intersection representations, etc.), Graph operations (line graphs, products, etc.), intersection graphs, graph drawing, pseudo-segments, Regularity lemma, FOS: Mathematics, Mathematics - Combinatorics, Computer Science - Computational Geometry, Combinatorics (math.CO)
Περιγραφή αρχείου: application/xml; application/pdf; text
Συνδεδεμένο Πλήρες ΚείμενοΣύνδεσμος πρόσβασης: http://arxiv.org/abs/2312.01028
https://zbmath.org/8071448
https://doi.org/10.1016/j.jctb.2025.04.007
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.59 -
2Academic Journal
Συγγραφείς: Agarwal, Pankaj K.Aff1, Ezra, EstherAff2, IDs00454025007929_cor1, Sharir, MichaAff3
Συνδεδεμένο Πλήρες ΚείμενοΠηγή: Discrete & Computational Geometry. 75(2):320-342
-
3Academic 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
-
4Academic 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
-
5Academic Journal
Συγγραφείς: Fox, J., Pach, János, Suk, A.
Συνεισφορές: Jacob Fox and János Pach and Andrew Suk
Θεματικοί όροι: pseudo-segments, QA Mathematics / matematika, Enumeration, Combinatorics, FOS: Mathematics, x-monotone, Combinatorics (math.CO), intersection graphs
Περιγραφή αρχείου: application/pdf; text
-
6Academic Journal
Συγγραφείς: Péter Györgyi, Bálint Hujter, Sándor Kisfaludi-Bak
Πηγή: Computational Geometry. 67:29-37
Θεματικοί όροι: Touching curves, Combinatorial geometry, 52C30, 0102 computer and information sciences, 16. Peace & justice, 01 natural sciences, Pseudo-segments, pseudo-segments, Numerical aspects of computer graphics, image analysis, and computational geometry, Computer graphics, computational geometry (digital and algorithmic aspects), FOS: Mathematics, Mathematics - Combinatorics, touching curves, Combinatorics (math.CO), 0101 mathematics, combinatorial geometry
Περιγραφή αρχείου: application/xml
Συνδεδεμένο Πλήρες ΚείμενοΣύνδεσμος πρόσβασης: http://arxiv.org/abs/1511.05425
https://zbmath.org/6837136
https://doi.org/10.1016/j.comgeo.2017.10.004
https://research.tue.nl/en/publications/451d5660-c9b1-4722-9a43-0026738d7552
https://doi.org/10.1016/j.comgeo.2017.10.004 -
7Academic Journal
Συγγραφείς: Sharir, Micha a, 1, Zahl, Joshua b, 2
Συνδεδεμένο Πλήρες ΚείμενοΠηγή: In Journal of Combinatorial Theory, Series A August 2017 150:1-35
-
8Academic Journal
Συγγραφείς: Hubert de Fraysseix, Patrice Ossona de Mendez
Συνεισφορές: Ossona de Mendez, Patrice
Πηγή: Discrete Applied Mathematics. 155:1079-1095
Θεματικοί όροι: [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], Contact representation, Applied Mathematics, Discrete Mathematics and Combinatorics, Stretchable pseudo-segments contact systems, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Barycentric systems
Συνδεδεμένο Πλήρες ΚείμενοΣύνδεσμος πρόσβασης: https://hal.science/hal-00147454v1
https://doi.org/10.1016/j.dam.2005.12.009 -
9Mixed 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.
Όροι ευρετηρίου: Enumeration, intersection graphs, pseudo-segments, x-monotone, InProceedings, Text, doc-type:ResearchArticle, publishedVersion
Σύνδεσμος:
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) -
10Book
Συγγραφείς: Györgyi , P., Hujter , B., Kisfaludi-Bak, S.
Πηγή: Computational Geometry vol.67 (2018) p.29-37 [ISSN 0925-7721]
Όροι ευρετηρίου: Combinatorial geometry, Touching curves, Pseudo-segments, Tijdschriftartikel, Article