2000 character limit reached
Approximating fractionally isomorphic graphons
Published 25 Oct 2022 in math.CO | (2210.14097v2)
Abstract: Greb\'ik and Rocha [Fractional Isomorphism of Graphons, Combinatorica 42, pp 365-404 (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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.