Generalized quasirandom graphs
From MaRDI portal
Publication:2464159
Recommendations
Cites work
- Counting graph homomorphisms
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs
- scientific article; zbMATH DE number 4027516 (Why is no real title available?)
- Limits of dense graph sequences
- Quasi-random graphs
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Szemerédi's partition and quasirandomness
- The rank of connection matrices and the dimension of graph algebras
Cited in
(49)- Quasi-randomness and the distribution of copies of a fixed graph
- Finitely forcible graph limits are universal
- Extremal graph theory and finite forcibility
- Discrepancy minimizing spectral clustering
- Limit densities of patterns in permutation inflations
- Finitely forcible graphons
- Compactness and finite forcibility of graphons
- Quasirandom permutations are characterized by 4-point densities
- Estimating and understanding exponential random graph models
- Modularity spectra, eigen-subspaces, and structure of weighted graphs
- Relating multiway discrepancy and singular values of nonnegative rectangular matrices
- On a question of Vera T. Sós about size forcing of graphons
- Spectra and structure of weighted graphs
- Quasirandom multitype graphs
- The quasi-randomness of hypergraph cut properties
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets
- Contractors and connectors of graph algebras
- From quasirandom graphs to graph limits and graphlets
- Testability of minimum balanced multiway cut densities
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Weak regularity and finitely forcible graph limits
- Finitely forcible graphons and permutons
- Glauber dynamics for Ising model on convergent dense graph sequences
- Limiting Crossing Numbers for Geodesic Drawings on the Sphere
- Finitely forcible graphons with an almost arbitrary structure
- Sparse graphs: metrics and random models
- Generalized quasirandom properties of expanding graph sequences
- The poset of hypergraph quasirandomness
- Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
- Quasi‐random graphs with given degree sequences
- scientific article; zbMATH DE number 5050599 (Why is no real title available?)
- Perfect matchings, rank of connection tensors and graph homomorphisms
- Counting Subgraphs in Degenerate Graphs
- Quasi-random graphs
- Quasirandomness in hypergraphs
- Quasi-random words and limits of word sequences
- Locally common graphs
- Graphon convergence of random cographs
- Monotone arithmetic complexity of graph homomorphism polynomials
- The large deviation principle for the Erdős-Rényi random graph
- Quasi-random graphs and graph limits
- Forcing generalised quasirandom graphs efficiently
- Beyond the expanders
- Efficient polynomial-time approximation scheme for the genus of dense graphs
- Forcing generalized quasirandom graphs efficiently (extended abstract)
- Bounds on the mod 2 homology of random 2-dimensional determinantal hypertrees
- Forcing quasirandomness in a regular tournament
- Matrix and discrepancy view of generalized random and quasirandom graphs
This page was built for publication: Generalized quasirandom graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464159)
