Academic Journal
A Structure Theorem for Pseudo-Segments and Its Applications
| Τίτλος: | A Structure Theorem for Pseudo-Segments and Its Applications |
|---|---|
| Συγγραφείς: | Fox, Jacob, Pach, János, Suk, Andrew |
| Συνεισφορές: | Jacob Fox and János Pach and Andrew Suk |
| Στοιχεία εκδότη: | Schloss Dagstuhl – Leibniz-Zentrum für Informatik |
| Έτος έκδοσης: | 2024 |
| Συλλογή: | DROPS - Dagstuhl Research Online Publication Server (Schloss Dagstuhl - Leibniz Center for Informatics ) |
| Θεματικοί όροι: | Regularity lemma, pseudo-segments, intersection graphs |
| Περιγραφή: | We prove a far-reaching strengthening of Szemerédi’s regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such graphs can be partitioned into a bounded number of parts of roughly the same size such that almost all of the bipartite graphs between pairs of parts are complete or empty. We use this to get an improved bound on disjoint edges in simple topological graphs, showing that every n-vertex simple topological graph with no k pairwise disjoint edges has at most n(log n)^O(log k) edges. |
| Τύπος εγγράφου: | article in journal/newspaper conference object |
| Περιγραφή αρχείου: | application/pdf |
| Γλώσσα: | English |
| 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 |
| DOI: | 10.4230/LIPIcs.SoCG.2024.59 |
| Διαθεσιμότητα: | https://doi.org/10.4230/LIPIcs.SoCG.2024.59 https://nbn-resolving.org/urn:nbn:de:0030-drops-200040 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.59 |
| Rights: | https://creativecommons.org/licenses/by/4.0/legalcode |
| Αριθμός Καταχώρησης: | edsbas.1ECF7265 |
| Βάση Δεδομένων: | BASE |
καταχωρήστε σχόλιο πρώτοι!