Approximating fractionally isomorphic graphons
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F23%3A00573944" target="_blank" >RIV/67985807:_____/23:00573944 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.ejc.2023.103751" target="_blank" >https://doi.org/10.1016/j.ejc.2023.103751</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2023.103751" target="_blank" >10.1016/j.ejc.2023.103751</a>
Alternative languages
Result language
angličtina
Original language name
Approximating fractionally isomorphic graphons
Original language description
Grebík and Rocha (2022) extended the well studied notion of fractional isomorphism of graphs to graphons. We prove that fractionally isomorphic graphons can be approximated in the cut distance by fractionally isomorphic finite graphs. This answers the main question from ibid. As an easy but convenient corollary, we deduce that every regular graphon can be approximated by regular graphs.
Czech name
—
Czech description
—
Classification
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
Result continuities
Project
<a href="/en/project/GX21-21762X" target="_blank" >GX21-21762X: Graph limits and beyond</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
European Journal of Combinatorics
ISSN
0195-6698
e-ISSN
1095-9971
Volume of the periodical
113
Issue of the periodical within the volume
October 2023
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
19
Pages from-to
103751
UT code for WoS article
001022229400001
EID of the result in the Scopus database
2-s2.0-85161960897