Quasi-random graphs
From MaRDI portal
Publication:5895286
Recommendations
Cites work
- 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?)
- 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
- 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)- scientific article; zbMATH DE number 15664 (Why is no real title available?)
- Quasi-randomness of graph balanced cut properties
- On the density of transitive tournaments
- Cryptographic hash functions from sequences of lifted Paley graphs
- Properties of Classes of Random Graphs
- No additional tournaments are quasirandom-forcing
- Coprime networks of the composite numbers: pseudo-randomness and synchronizability
- Note on the existence of large minimal blocking sets in Galois planes
- Embedding cycles in finite planes
- A note on eigenvalue bounds for independence numbers of non-regular graphs
- Lower bounds for r₂(K₁ + G) and r₃(K₁ + G) from Paley graph and generalization
- On hypergraphs having evenly distributed subhypergraphs
- Relating multiway discrepancy and singular values of nonnegative rectangular matrices
- Generalized quasirandom properties of expanding graph sequences
- Characteristic power series of graph limits
- Quasirandom arithmetic permutations
- Semantic limits of dense combinatorial objects
- The road to deterministic matrices with the restricted isometry property
- Linear dependence between hereditary quasirandomness conditions
- Eigenvalues and extremal degrees of graphs
- Flag algebras
- Packing tight Hamilton cycles in 3-uniform hypergraphs
- Extremal edge polytopes
- Packing Hamilton cycles in random and pseudo-random hypergraphs
- Clustering coefficients of large networks
- Extrema of graph eigenvalues
- Limit densities of patterns in permutation inflations
- An approximate version of the tree packing conjecture
- Perfect packings in quasirandom hypergraphs. I.
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On nowhere dense graphs
- Hypercube percolation
- Testability and repair of hereditary hypergraph properties
- Quasi‐random graphs with given degree sequences
- On pseudo-random subsets of the set of the integers not exceeding \(N\)
- A note on even cycles and quasirandom tournaments
- Wavelength routing in optical networks of diameter two
- \(\mathrm{MOD}_p\)-tests, almost independence and small probability spaces (extended abstract)
- Natural quasirandomness properties
- Quasirandomness in hypergraphs
- Quasirandomness in hypergraphs
- Quasi-random words and limits of word sequences
- Random walks on quasirandom graphs
- Intersections of graphs
- Graph norms and Sidorenko's conjecture
- The poset of hypergraph quasirandomness
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Two remarks on graph norms
- Quasi-random Boolean functions
- Perfect Packings in Quasirandom Hypergraphs II
- A note on random \(k\)-dimensional posets
- Inverse expander mixing for hypergraphs
- A characterization of functions with vanishing averages over products of disjoint sets
- Scaling of weighted spectral distribution in deterministic scale-free networks
- Characterization of quasirandom permutations by a pattern sum
- Approximating the rectilinear crossing number
- From quasirandom graphs to graph limits and graphlets
- Cut distance identifying graphon parameters over weak* limits
- Hamiltonicity in cherry-quasirandom 3-graphs
- The étale-open topology and the stable fields conjecture
- On some graph densities in locally dense graphs
- Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
- Quasi-random oriented graphs
- Random Latin square graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Limits of \(k\)-dimensional poset sequences
- Weak hypergraph regularity and linear hypergraphs
- Quasirandom-Forcing Orientations of Cycles
- On the graph limit question of Vera T. Sós
- The step Sidorenko property and non-norming edge-transitive graphs
- On the graph limit question of Vera T. Sós
- Regularity lemmas for hypergraphs and quasi-randomness
- Rumor spreading on random regular graphs and expanders
- A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
- Quasirandom permutations
- Regularity lemmas for clustering graphs
- On an adjacency property of almost all graphs
- Testing linear inequalities of subgraph statistics
- Sparse quasi-random graphs
- Quasi-randomness and the distribution of copies of a fixed graph
- Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets
- Approximating the rectilinear crossing number
- More about sparse halves in triangle-free graphs
- A new upper bound for diagonal Ramsey numbers
- The extremal function for complete minors
- Discrepancy properties for random regular digraphs
- Laplace eigenvalues of graphs---a survey
- Globally optimizing small codes in real projective spaces
- Hermitian matrices and graphs: Singular values and discrepancy
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- Regular pairs in sparse random graphs I
- Random quantum graphs
- On the density of a graph and its blowup
- On the additive bases problem in finite fields
- Random subcube intersection graphs. I: Cliques and covering
- Continuity of some non-local functionals with respect to a convergence of the underlying measures
- On a question of Vera T. Sós about size forcing of graphons
- Large holes in quasi-random graphs
- A tight bound for hypergraph regularity
- The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes
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)
