Quasi-random graphs
From MaRDI portal
Recommendations
Cites work
- A Constructive Solution to a Tournament Problem
- Cyclotomy and difference families in elementary Abelian groups
- Explicit construction of linear sized tolerant networks
- Graphs which contain all small graphs
- scientific article; zbMATH DE number 3902655 (Why is no real title available?)
- scientific article; zbMATH DE number 4099367 (Why is no real title available?)
- scientific article; zbMATH DE number 3487460 (Why is no real title available?)
- scientific article; zbMATH DE number 3055095 (Why is no real title available?)
- Intersection theorems for vector spaces
- Intersection theorems with geometric consequences
- On Character Sums and Primitive Roots†
- On universality of graphs with uniformly distributed edges
- Quasi-random hypergraphs
- The eigenvalues of random symmetric matrices
- The number of submatrices of a given type in a Hadamard matrix and related results
- Topics in multiplicative number theory
Cited in
(only showing first 100 items - show all)- Large holes in quasi-random graphs
- Quasi-randomness and the distribution of copies of a fixed graph
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- On testing the `pseudo-randomness' of a hypergraph
- Note on the existence of large minimal blocking sets in Galois planes
- Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- Wavelength routing in optical networks of diameter two
- Scaling of weighted spectral distribution in deterministic scale-free networks
- Finitely forcible graph limits are universal
- The step Sidorenko property and non-norming edge-transitive graphs
- How unproportional must a graph be?
- Extremal graph theory and finite forcibility
- Discrepancy minimizing spectral clustering
- Limits of \(k\)-dimensional poset sequences
- Graphs and Hermitian matrices: eigenvalue interlacing
- Pseudo-random hypergraphs
- Quasirandom permutations
- Sparse quasi-random graphs
- The extremal function for complete minors
- Hermitian matrices and graphs: Singular values and discrepancy
- Embedding graphs with bounded degree in sparse pseudorandom graphs
- Bounds for graph regularity and removal lemmas
- Linear dependence between hereditary quasirandomness conditions
- Regularity lemmas for clustering graphs
- Tournament quasirandomness from local counting
- Recent progress in combinatorial random matrix theory
- On explicit random-like tournaments
- Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs
- An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
- Locally random groups
- Ramsey numbers of books and quasirandomness
- Characteristic power series of graph limits
- No additional tournaments are quasirandom-forcing
- Continuity of some non-local functionals with respect to a convergence of the underlying measures
- Two remarks on graph norms
- Cut distance identifying graphon parameters over weak* limits
- Hamiltonicity in cherry-quasirandom 3-graphs
- Applications of the Harary-Sachs theorem for hypergraphs
- The minimum spectral radius of \(K_{r + 1}\)-saturated graphs
- Limit densities of patterns in permutation inflations
- More on quasi-random graphs, subgraph counts and graph limits
- Finitely forcible graphons
- Clustering coefficients of large networks
- Induced subgraphs with many repeated degrees
- Packing degenerate graphs
- Compactness and finite forcibility of graphons
- Approximating the rectilinear crossing number
- A tight bound for hypergraph regularity
- A relative Szemerédi theorem
- Eigenvalues of non-regular linear quasirandom hypergraphs
- Quasirandom permutations are characterized by 4-point densities
- Counting results for sparse pseudorandom hypergraphs. I.
- Counting results for sparse pseudorandom hypergraphs. II.
- On nowhere dense graphs
- Extremal results in sparse pseudorandom graphs
- On pseudo-random subsets of the set of the integers not exceeding \(N\)
- Generalized quasirandom graphs
- The smallest eigenvalue of \(K_{r}\)-free graphs
- Quasirandom arithmetic permutations
- Relating multiway discrepancy and singular values of nonnegative rectangular matrices
- Quasi-random multilinear polynomials
- Mean-field conditions for percolation on finite graphs
- Hamiltonicity in prime sum graphs
- On a question of Vera T. Sós about size forcing of graphons
- Tiling multipartite hypergraphs in quasi-random hypergraphs
- An approximate version of the tree packing conjecture
- Perfect packings in quasirandom hypergraphs. I.
- Inverse expander mixing for hypergraphs
- A characterization of functions with vanishing averages over products of disjoint sets
- Hamilton cycles in quasirandom hypergraphs
- Discrepancy and eigenvalues of Cayley graphs
- A note on random k-dimensional posets
- Hereditary quasi-random properties of hypergraphs
- Rumor spreading on random regular graphs and expanders
- Quasi-random oriented graphs
- Packing tight Hamilton cycles in 3-uniform hypergraphs
- Packing Hamilton cycles in random and pseudo-random hypergraphs
- Random Latin square graphs
- Quasi-randomness of graph balanced cut properties
- Non-three-colourable common graphs exist
- Discrepancy properties for random regular digraphs
- σ-algebras for quasirandom hypergraphs
- Approximating the rectilinear crossing number
- Cryptographic hash functions from sequences of lifted Paley graphs
- Testability and repair of hereditary hypergraph properties
- Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
- On the additive bases problem in finite fields
- Random subcube intersection graphs. I: Cliques and covering
- Weak quasi-randomness for uniform hypergraphs
- Quasi-random hypergraphs revisited
- The quasi-randomness of hypergraph cut properties
- Intersections of graphs
- Generalizations of Fourier analysis, and how to apply them
- Discrepancy of random graphs and hypergraphs
- A counting lemma for sparse pseudorandom hypergraphs
- Embedding tetrahedra into quasirandom hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Quasi-random tournaments
- Characterization of quasirandom permutations by a pattern sum
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)
