First order limits of sparse graphs: Plane trees and path-width

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F17%3A43932806" target="_blank" >RIV/49777513:23520/17:43932806 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14330/17:00094633
Result on the web
<a href="http://onlinelibrary.wiley.com/doi/10.1002/rsa.20676/full" target="_blank" >http://onlinelibrary.wiley.com/doi/10.1002/rsa.20676/full</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/rsa.20676" target="_blank" >10.1002/rsa.20676</a>

Result language
angličtina
Original language name
First order limits of sparse graphs: Plane trees and path-width
Original language description
Nešetřil and Ossona de Mendez introduced the notion of first order convergence as an attempt to unify the notions of convergence for sparse and dense graphs. It is known that there exist first order convergent sequences of graphs with no limit modeling (an analytic representation of the limit). On the positive side, every first order convergent sequence of trees or graphs with no long path (graphs with bounded tree-depth) has a limit modeling. We strengthen these results by showing that every first order convergent sequence of plane trees (trees with embeddings in the plane) and every first order convergent sequence of graphs with bounded path-width has a limit modeling.
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
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)