Generalized quasirandom graphs
From MaRDI portal
Publication:2464159
DOI10.1016/j.jctb.2007.06.005zbMath1127.05094OpenAlexW1966460832MaRDI QIDQ2464159
Publication date: 10 December 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/110712/1/quasirandom.pdf
Random graphs (graph-theoretic aspects) (05C80) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10)
Related Items
Perfect matchings, rank of connection tensors and graph homomorphisms, Finitely forcible graph limits are universal, Counting Subgraphs in Degenerate Graphs, Quasirandom permutations are characterized by 4-point densities, Locally common graphs, From quasirandom graphs to graph limits and graphlets, On a question of Vera T. Sós about size forcing of graphons, Graphon convergence of random cographs, Monotone arithmetic complexity of graph homomorphism polynomials, Extremal graph theory and finite forcibility, Unnamed Item, Testability of minimum balanced multiway cut densities, Matrix and discrepancy view of generalized random and quasirandom graphs, Estimating and understanding exponential random graph models, Convergent sequences of dense graphs. II. Multiway cuts and statistical physics, Finitely forcible graphons with an almost arbitrary structure, The large deviation principle for the Erdős-Rényi random graph, Quasi-random graphs and graph limits, Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets, Limit densities of patterns in permutation inflations, Finitely forcible graphons and permutons, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Beyond the expanders, Discrepancy minimizing spectral clustering, Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets, Unnamed Item, Finitely forcible graphons, The effect of induced subgraphs on quasi-randomness, Quasirandomness in hypergraphs, Contractors and connectors of graph algebras, Sparse graphs: Metrics and random models, Modularity spectra, eigen-subspaces, and structure of weighted graphs, Quasi-random words and limits of word sequences, Generalized quasirandom properties of expanding graph sequences, Weak regularity and finitely forcible graph limits, Compactness and finite forcibility of graphons, Quasi-randomness and the distribution of copies of a fixed graph, The quasi-randomness of hypergraph cut properties, Limiting Crossing Numbers for Geodesic Drawings on the Sphere, The poset of hypergraph quasirandomness, Relating multiway discrepancy and singular values of nonnegative rectangular matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Limits of dense graph sequences
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- The rank of connection matrices and the dimension of graph algebras
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Szemerédi's partition and quasirandomness
- Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs
- Quasi-random graphs