Induced subdivisions and bounded expansion

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10385401" target="_blank" >RIV/00216208:11320/18:10385401 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.ejc.2017.10.004" target="_blank" >https://doi.org/10.1016/j.ejc.2017.10.004</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2017.10.004" target="_blank" >10.1016/j.ejc.2017.10.004</a>

Result language
angličtina
Original language name
Induced subdivisions and bounded expansion
Original language description
We prove that for every graph H and for every integer s, the class of graphs that do not contain K-s, K-s,K-s, or any subdivision of H as induced subgraphs has bounded expansion; this strengthens a result of Kuhn and Osthus (2004). The argument also gives another characterization of graph classes with bounded expansion and of nowhere-dense graph classes.
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
10101 - Pure mathematics

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)