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