Approximating fractionally isomorphic graphons

Autoři: Mgr. Jan Hladký, Ph.D.
Eng Keat Hng
Rok vydání: 2023
Typ publikace: Článek v odborném periodiku
Periodikum: European Journal of Combinatorics
Projekty: Limity grafů a související obory
Bibliografická citace: HLADKÝ, Jan, HNG, Eng Keat. Approximating fractionally isomorphic graphons. European Journal of Combinatorics. 2023, 113(October 2023), 103751. ISSN 0195-6698. E-ISSN 1095-9971
Dostupné z: doi:10.1016/j.ejc.2023.103751.
DOI: 10.1016/j.ejc.2023.103751
ID: 573944
Online záznam: Zobrazit online záznam

Abstrakt

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.