Quasi-random graphs
From MaRDI portal
Publication:5895286
DOI10.1007/BF02125347zbMATH Open0715.05057DBLPjournals/combinatorica/ChungGW89OpenAlexW2901284226WikidataQ56853020 ScholiaQ56853020MaRDI QIDQ5895286FDOQ5895286
Authors: Fan Chung, Ron Graham, Richard M. Wilson
Publication date: 1989
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02125347
Recommendations
Cites Work
- The eigenvalues of random symmetric matrices
- Intersection theorems with geometric consequences
- Topics in multiplicative number theory
- On universality of graphs with uniformly distributed edges
- Title not available (Why is that?)
- Explicit construction of linear sized tolerant networks
- Quasi-random hypergraphs
- Title not available (Why is that?)
- A Constructive Solution to a Tournament Problem
- Title not available (Why is that?)
- Cyclotomy and difference families in elementary Abelian groups
- Title not available (Why is that?)
- On Character Sums and Primitive Roots†
- Intersection theorems for vector spaces
- Graphs which contain all small graphs
- The number of submatrices of a given type in a Hadamard matrix and related results
Cited In (only showing first 100 items - show all)
- Properties of Classes of Random Graphs
- Note on the existence of large minimal blocking sets in Galois planes
- On hypergraphs having evenly distributed subhypergraphs
- Eigenvalues and extremal degrees of graphs
- On pseudo-random subsets of the set of the integers not exceeding \(N\)
- Wavelength routing in optical networks of diameter two
- Intersections of graphs
- A note on random \(k\)-dimensional posets
- Scaling of weighted spectral distribution in deterministic scale-free networks
- On some graph densities in locally dense graphs
- Random Latin square graphs
- Quasirandom-Forcing Orientations of Cycles
- A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
- The step Sidorenko property and non-norming edge-transitive graphs
- Quasirandom permutations
- Regularity lemmas for hypergraphs and quasi-randomness
- Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets
- More about sparse halves in triangle-free graphs
- Regular pairs in sparse random graphs I
- Random quantum graphs
- Continuity of some non-local functionals with respect to a convergence of the underlying measures
- On the density of a graph and its blowup
- Large holes in quasi-random graphs
- Graphs and Hermitian matrices: eigenvalue interlacing
- Hamilton cycles in dense vertex-transitive graphs
- Induced subgraphs with many repeated degrees
- Quasirandom Cayley graphs
- An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
- Quasi-random graphs
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- How unproportional must a graph be?
- Quasi-random multilinear polynomials
- Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
- Finding any given 2‐factor in sparse pseudorandom graphs efficiently
- An approximate version of Sidorenko's conjecture
- Hamilton cycles in quasirandom hypergraphs
- Quasi-random tournaments
- A unified view of graph regularity via matrix decompositions
- Matrix and discrepancy view of generalized random and quasirandom graphs
- The Green-Tao theorem: an exposition
- Quasi-random graphs and graph limits
- The smallest eigenvalue of \(K_{r}\)-free graphs
- The quasi-randomness of hypergraph cut properties
- The cut metric, random graphs, and branching processes
- On testing the `pseudo-randomness' of a hypergraph
- Limits of functions on groups
- Mean-field conditions for percolation on finite graphs
- Hereditary quasirandom properties of hypergraphs
- Non-commutative methods in additive combinatorics and number theory
- Quasirandom Latin squares
- Off-diagonal book Ramsey numbers
- Counting Subgraphs in Degenerate Graphs
- Turán's theorem for pseudo-random graphs
- Rates of convergence for multivariate normal approximation with applications to dense graphs and doubly indexed permutation statistics
- Hamiltonicity in prime sum graphs
- Discrepancy minimizing spectral clustering
- Pseudo-random hypergraphs
- Diagonal Ramsey via effective quasirandomness
- On the density of transitive tournaments
- Quasi-randomness of graph balanced cut properties
- Cryptographic hash functions from sequences of lifted Paley graphs
- Title not available (Why is that?)
- Embedding cycles in finite planes
- A note on eigenvalue bounds for independence numbers of non-regular graphs
- Lower bounds for \(r_2(K_1 + G)\) and \(r_3(K_1 + G)\) from Paley graph and generalization
- Relating multiway discrepancy and singular values of nonnegative rectangular matrices
- Flag algebras
- The road to deterministic matrices with the restricted isometry property
- Packing tight Hamilton cycles in 3-uniform hypergraphs
- Packing Hamilton cycles in random and pseudo-random hypergraphs
- Quasi‐random graphs with given degree sequences
- Extremal edge polytopes
- Extrema of graph eigenvalues
- Testability and repair of hereditary hypergraph properties
- On nowhere dense graphs
- Quasirandomness in hypergraphs
- Quasirandomness in hypergraphs
- Quasi-random words and limits of word sequences
- An approximate version of the tree packing conjecture
- Perfect packings in quasirandom hypergraphs. I.
- Hypercube percolation
- Graph norms and Sidorenko's conjecture
- The poset of hypergraph quasirandomness
- Perfect Packings in Quasirandom Hypergraphs II
- Random walks on quasirandom graphs
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Inverse expander mixing for hypergraphs
- A characterization of functions with vanishing averages over products of disjoint sets
- From quasirandom graphs to graph limits and graphlets
- Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Weak hypergraph regularity and linear hypergraphs
- On an adjacency property of almost all graphs
- Sparse quasi-random graphs
- Quasi-randomness and the distribution of copies of a fixed graph
- A new upper bound for diagonal Ramsey numbers
- The extremal function for complete minors
- Hermitian matrices and graphs: Singular values and discrepancy
- Laplace eigenvalues of graphs---a survey
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
This page was built for publication: Quasi-random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895286)