More on quasi-random graphs, subgraph counts and graph limits
From MaRDI portal
Publication:2255808
DOI10.1016/j.ejc.2015.01.001zbMath1307.05204arXiv1405.6808OpenAlexW2963444279MaRDI QIDQ2255808
Publication date: 18 February 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.6808
Related Items
A characterization of functions with vanishing averages over products of disjoint sets, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, FORCING QUASIRANDOMNESS WITH TRIANGLES
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of functions with vanishing averages over products of disjoint sets
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Quasi-random graphs and graph limits
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Quasi-randomness and the distribution of copies of a fixed graph
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- Quasi-randomness of graph balanced cut properties
- The effect of induced subgraphs on quasi-randomness
- The quasi-randomness of hypergraph cut properties
- Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets
- Szemerédi's partition and quasirandomness
- Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs
- Quasi-random graphs