scientific article; zbMATH DE number 4027516

Recommendations

Pseudo-random graphs
Pseudorandom Graphs in Data Structures
Pseudo-random hypergraphs
scientific article; zbMATH DE number 863475
scientific article; zbMATH DE number 1231233
scientific article; zbMATH DE number 1540669
Random Graphs
scientific article; zbMATH DE number 3875330
scientific article; zbMATH DE number 5610906
scientific article; zbMATH DE number 3904630

Cited in

(only showing first 100 items - show all)

Quasi-random subsets of \(\mathbb{Z}_ n\)
On testing the `pseudo-randomness' of a hypergraph
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
Extremal graph theory and finite forcibility
On the maximum density of fixed strongly connected subtournaments
Discrepancy minimizing spectral clustering
On packing Hamilton cycles in \(\varepsilon\)-regular graphs
Pseudo-random hypergraphs
A simple linear expected time algorithm for finding a Hamilton path
The extremal function for complete minors
Hermitian matrices and graphs: Singular values and discrepancy
Embedding graphs with bounded degree in sparse pseudorandom graphs
Linear dependence between hereditary quasirandomness conditions
The normalized matching property in random and pseudorandom bipartite graphs
Tournament quasirandomness from local counting
Multigraph limits, unbounded kernels, and Banach space decorated graphs
Ramsey numbers of books and quasirandomness
No additional tournaments are quasirandom-forcing
Two remarks on graph norms
Hamiltonicity in cherry-quasirandom 3-graphs
A clique-free pseudorandom subgraph of the pseudo polarity graph
Toughness in pseudo-random graphs
More on quasi-random graphs, subgraph counts and graph limits
Clique-factors in sparse pseudorandom graphs
Quasirandom permutations are characterized by 4-point densities
Counting results for sparse pseudorandom hypergraphs. I.
Counting results for sparse pseudorandom hypergraphs. II.
Extremal results in sparse pseudorandom graphs
Generalized quasirandom graphs
Relating multiway discrepancy and singular values of nonnegative rectangular matrices
Quasi-random multilinear polynomials
Dense expanders and pseudo-random bipartite graphs
An approximate version of the tree packing conjecture
Perfect packings in quasirandom hypergraphs. I.
A characterization of functions with vanishing averages over products of disjoint sets
A note on random k-dimensional posets
Hereditary quasi-random properties of hypergraphs
The quasi-randomness of hypergraph cut properties
Pseudo-random properties of self-complementary symmetric graphs
Intersections of graphs
Generalizations of Fourier analysis, and how to apply them
Embedding tetrahedra into quasirandom hypergraphs
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Complexity and randomness in the Heisenberg groups (and beyond)
Characterization of quasirandom permutations by a pattern sum
scientific article; zbMATH DE number 4099367 (Why is no real title available?)
Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
Hereditary quasirandomness without regularity
Weak regularity and finitely forcible graph limits
Forcing quasirandomness with triangles
Quasirandom Cayley graphs
Optimal covers with Hamilton cycles in random graphs
Extrema of graph eigenvalues
Triangle‐factors in pseudorandom graphs
A proof of Brouwer's toughness conjecture
Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
scientific article; zbMATH DE number 7478535 (Why is no real title available?)
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
Hitting time of edge disjoint Hamilton cycles in random subgraph processes on dense base graphs
Complete Minors in Graphs Without Sparse Cuts
Finitely forcible graphons with an almost arbitrary structure
Semantic limits of dense combinatorial objects
Pseudorandom Graphs in Data Structures
Popular progression differences in vector spaces II
Generalized quasirandom properties of expanding graph sequences
Optimal bounds for single-source Kolmogorov extractors
Edge-disjoint Hamilton cycles in random graphs
On the density of transitive tournaments
Perfect Packings in Quasirandom Hypergraphs II
Pseudo-random graphs
A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
Lower bound on the size of a quasirandom forcing set of permutations
Random strongly regular graphs?
Quasirandomness in hypergraphs
Linear quasi-randomness of subsets of abelian groups and hypergraphs
Quasi-random words and limits of word sequences
Linear quasi-randomness of subsets of abelian groups and hypergraphs
Diagonal Ramsey via effective quasirandomness
Concentration estimates for functions of finite high‐dimensional random arrays
Quasirandom-Forcing Orientations of Cycles
On some graph densities in locally dense graphs
Covering cycles in sparse graphs
A unified view of graph regularity via matrix decompositions
Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
1‐independent percolation on ℤ2×Kn
Natural quasirandomness properties
Quasirandom Latin squares
On the extremal function for graph minors
Extremal results on feedback arc sets in digraphs
Restricted problems in extremal combinatorics
Local-vs-global combinatorics
Quasi-random graphs and graph limits
Coprime networks of the composite numbers: pseudo-randomness and synchronizability
More non-bipartite forcing pairs
Forcing generalised quasirandom graphs efficiently
A unified combinatorial view beyond some spectral properties
From flip processes to dynamical systems on graphons

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768936)