More on quasi-random graphs, subgraph counts and graph limits

We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It has been shown by several authors that several such conditions are quasi-random, but that there are exceptions. In order to understand this better, we investigate some new properties of this type. We show that these properties too are quasi-random, at least in some cases; however, there are also cases that are left as open problems, and we discuss why the proofs fail in these cases. The proofs are based on the theory of graph limits; and on the method and results developed by Janson (2011), this translates the combinatorial problem to an analytic problem, which then is translated to an algebraic problem.

[1]  Raphael Yuster,et al.  The effect of induced subgraphs on quasi-randomness , 2010 .

[2]  Raphael Yuster.  Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets , 2010, Comb..

[3]  Hao Huang,et al.  Quasi-randomness of graph balanced cut properties , 2012, Random Struct. Algorithms.

[4]  Asaf Shapira.  Quasi-randomness and the distribution of copies of a fixed graph , 2008, Comb..

[5]  B. Szegedy,et al.  Szemerédi’s Lemma for the Analyst , 2007 .

[6]  Miklós Simonovits,et al.  Szemerédi's Partition and Quasirandomness , 1991, Random Struct. Algorithms.

[7]  Raphael Yuster,et al.  The quasi‐randomness of hypergraph cut properties , 2010, Random Struct. Algorithms.

[8]  Svante Janson,et al.  Quasi-random graphs and graph limits , 2009, Eur. J. Comb..

[9]  V. Sós,et al.  Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.

[10]  F. Petrov.  General removal lemma , 2013, 1309.3795.

[11]  Fan Chung Graham,et al.  Quasi-random graphs , 1988, Comb..

[12]  Raphael Yuster,et al.  The effect of induced subgraphs on quasi-randomness , 2008, SODA '08.

[13]  A. Thomason.  Pseudo-Random Graphs , 1987 .

[14]  Miklós Simonovits,et al.  Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs , 1997, Comb..

[15]  Miklós Simonovits,et al.  Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs , 2003, Combinatorics, Probability and Computing.

[16]  Pooya Hatami,et al.  A characterization of functions with vanishing averages over products of disjoint sets , 2016, Eur. J. Comb..

[17]  László Lovász,et al.  Limits of dense graph sequences , 2004, J. Comb. Theory B.

[18]  V. Sós,et al.  Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics , 2012 .

[19]  László Lovász,et al.  Large Networks and Graph Limits , 2012, Colloquium Publications.