Skip to main content
Log in

Fractional Isomorphism of Graphons

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

We work out the theory of fractional isomorphism of graphons as a generalization to the classical theory of fractional isomorphism of finite graphs. The generalization is given in terms of homomorphism densities of finite trees and it is characterized in terms of distributions on iterated degree measures, Markov operators, weak isomorphism of a conditional expectation with respect to invariant sub-σ-algebras and isomorphism of certain quotients of given graphons.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. L. Babai, P. Erdős and S. Selkow: Random graph isomorphism, SIAM Journal on Computing. 9 (1980), 628–635.

    Article  MathSciNet  Google Scholar 

  2. L. Babai: Graph Isomorphism in Quasipolynomial Time, arXiv:1512.03547.

  3. P. Billingsley: Probability and Measure, Third edition, Wiley, 1995.

  4. C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós and K. Vesztergombi: Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing, Adv. Math. 219 (2008), 1801–1851.

    Article  MathSciNet  Google Scholar 

  5. C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós and K. Vesztergombi: Convergent sequences of dense graphs II, Multiway cuts and statistical physics, Ann. Math. 176 (2012), 151–219.

    Article  MathSciNet  Google Scholar 

  6. H. Dell, M. Grohe and G. Rattan: Lovász meets Weisfeiler and Leman, in: 45th International Colloquium on Automata, Languages, and Programming, ICALP, Prague, Czech Republic, 2018, 40:1–40:14.

  7. Z. Dvořák: On recognizing graphs by numbers of homomorphisms, J. Graph Theory 64 (2010), 330–342.

    Article  MathSciNet  Google Scholar 

  8. T. Eisner, B. Farkas, M. Haase and R. Nagel: Operator Theoretic Aspects of Ergodic Theory, Graduate Texts in Mathematics, Springer International Publishing, 2015.

  9. J. Grebík and I. Rocha: A graphon perspective for fractional isomorphism, Acta Math. Univ. Comenian. (N.S.) 88 (2019), 759–765.

    MathSciNet  Google Scholar 

  10. J. Hladký and I. Rocha: Independent sets, cliques, and colorings in graphons, European J. Combin. 88 (2020), 103108.

    Article  MathSciNet  Google Scholar 

  11. J. Hladký, P. Hu and D. Piguet: Tilings in graphons, European J. Combin. 93 (2021), 103284.

    Article  MathSciNet  Google Scholar 

  12. A. S. Kechris: Classical Descriptive Set Theory, Graduate texts in mathematics, Springer-Verlag, 1995.

  13. D. Kerr and H. Li: Independence and Dichotomies, Springer Monographs in Mathematics, Springer International Publishing, 2016.

  14. L. Lovász: Operations with structures, Acta Mathematica Hungarica 18 (1967), 321–328.

    MathSciNet  MATH  Google Scholar 

  15. L. Lovász and B. Szegedy: Limits of dense graph sequences, J. Combin. Theory Ser. B 96 (2006), 933–957.

    Article  MathSciNet  Google Scholar 

  16. L. Lovász: Large Networks and Graph Limits., volume 60 of Colloquium Publications, American Mathematical Society, 2012.

  17. M. Ramana, E. Scheinerman and D. Ullman: Fractional isomorphism of graphs, Discrete Mathematics 132 (1994), 247–265.

    Article  MathSciNet  Google Scholar 

  18. W. Rudin: Functional Analysis, McGraw-Hill, New York 1973.

  19. W. Rudin: Principles of mathematical analysis, Third edition, International Series in Pure and Applied Mathematics, McGraw-Hill, New York-Auckland-Düsseldorf, 1976.

    MATH  Google Scholar 

  20. W. Rudin: Real and Complex Analysis, McGraw-Hill, New York 1987.

    MATH  Google Scholar 

  21. E. Scheinerman and D. Ullman: Fractional Graph Theory, A Rational Approach to the Theory of Graphs.

  22. G. Tinhofer: Graph isomorphism and theorems of Birkhoff type, Computing 36 (1986), 285–300.

    Article  MathSciNet  Google Scholar 

  23. G. Tinhofer: A note on compact graphs, Discrete Applied Mathematics 30 (1991), 253–264.

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

The authors are grateful to Jan Hladky for useful discussions and help, and to anonymous referees for many useful suggestions and comments that helped to improve the presentation of the paper. The first author also thanks Jan Bydžovský, Jan Hladký and Oleg Pikhurko for help with the current version of the introduction.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jan Grebík.

Additional information

Grebík was supported by the Czech Science Foundation, grant number GJ16-07822Y, by the grant GAUK 900119 of Charles University and by Leverhulme Research Project Grant RPG-2018-424. Part of the work was done while Grebík was affiliated with Institute of Computer Science of the Czech Academy of Sciences, with institutional support RVO:67985807.

Rocha was supported by the Czech Science Foundation, grant number GJ16-07822Y and GA19-08740S. With institutional support RVO:67985807.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Grebík, J., Rocha, I. Fractional Isomorphism of Graphons. Combinatorica 42, 365–404 (2022). https://doi.org/10.1007/s00493-021-4336-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-021-4336-9

Mathematics Subject Classification (2010)

Navigation