Asymptotic dimension of intersection graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10491420" target="_blank" >RIV/00216208:11320/25:10491420 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=~168Ih6wJ1" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=~168Ih6wJ1</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2022.103631" target="_blank" >10.1016/j.ejc.2022.103631</a>

Result language
angličtina
Original language name
Asymptotic dimension of intersection graphs
Original language description
We show that intersection graphs of compact convex sets in R(n )of bounded aspect ratio have asymptotic dimension at most 2n+ 1. More generally, we show this is the case for intersection graphs of systems of subsets of any metric space of Assouad- Nagata dimension n that satisfy the following condition: For each r, s > 0 and every point p, the number of pairwise-disjoint elements of diameter at least s in the system that are at distance at most r from p is bounded by a function of r/s. (c) 2022 Elsevier Ltd. All rights reserved.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/LL2005" target="_blank" >LL2005: Algorithms and Complexity within and beyond Bounded Expansion</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)