Limits of dense graph sequences-Reference-Cited by-同舟云学术

Limits of dense graph sequences

Published:2006-11 Issue:6 Volume:96 Page:933-957
ISSN:0095-8956
Container-title:Journal of Combinatorial Theory, Series B
language:en
Short-container-title:Journal of Combinatorial Theory, Series B

Author:

Lovász László,Szegedy Balázs

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference10 articles.

1. Recurrence of distributional limits of finite planar graphs;Benjamini;Electron. J. Probab.,2001

2. Tricks or treats with the Hilbert matrix;Choi;Amer. Math. Monthly,1983

3. Quasi-random graphs;Chung;Combinatorica,1989

4. Strong independence of graphcopy functions;Erdős,1979

5. M. Freedman, L. Lovász, A. Schrijver, Reflection positivity, rank connectivity, and homomorphism of graphs, MSR Tech Report # MSR-TR-2004-41, ftp://ftp.research.microsoft.com/pub/tr/TR-2004-41.pdf

Cited by 445 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal investment in a large population of competitive and heterogeneous agents;Finance and Stochastics;2024-02-05

2. Graph sequences sampled from Robinson graphons;European Journal of Combinatorics;2024-02

3. Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets;Proceedings of the ACM on Programming Languages;2024-01-05

4. Thermodynamic limit of spin systems on random graphs;Physical Review Research;2024-01-03

5. Weisfeiler-Leman Indistinguishability of Graphons;The Electronic Journal of Combinatorics;2023-12-01