Quasi-Random Set Systems
From MaRDI portal
Publication:4713353
DOI10.2307/2939258zbMath0761.05072OpenAlexW4241409691MaRDI QIDQ4713353
Ronald L. Graham, Fan R. K. Chung
Publication date: 25 June 1992
Full work available at URL: https://doi.org/10.2307/2939258
Related Items
Lower bound on the size of a quasirandom forcing set of permutations, Intersections of graphs, Quasirandom permutations are characterized by 4-point densities, Quasi-randomness of graph balanced cut properties, A Note on Even Cycles and Quasirandom Tournaments, Constructing quasi-random subsets of \(\mathbb Z_N\) by using elliptic curves, An approximate version of Sidorenko's conjecture, From quasirandom graphs to graph limits and graphlets, Quasirandom-Forcing Orientations of Cycles, Quasirandom Latin squares, Perfect Packings in Quasirandom Hypergraphs II, Extremal results in sparse pseudorandom graphs, Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets, FORCING QUASIRANDOMNESS WITH TRIANGLES, On pseudo-random subsets of the set of the integers not exceeding \(N\), On hypergraphs having evenly distributed subhypergraphs, Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets, Mathematical vanity plates, The effect of induced subgraphs on quasi-randomness, Quasirandomness in hypergraphs, Linear quasi-randomness of subsets of abelian groups and hypergraphs, Tournament quasirandomness from local counting, Cohomological Aspects of Hypergraphs, Some properties of a higher-order coboundary operator, Characterization of quasirandom permutations by a pattern sum, Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs, Quasirandom permutations, Quasirandom arithmetic permutations, Quasi-randomness and the distribution of copies of a fixed graph, Weak quasi-randomness for uniform hypergraphs, Quasi-random hypergraphs revisited, The quasi-randomness of hypergraph cut properties, Quasi-Random Oriented Graphs, No additional tournaments are quasirandom-forcing, The poset of hypergraph quasirandomness, Hypergraphs, quasi-randomness, and conditions for regularity, Ample simplicial complexes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- On universality of graphs with uniformly distributed edges
- The number of submatrices of a given type in a Hadamard matrix and related results
- Some Ramsey-Turán type results for hypergraphs
- Graphs which contain all small graphs
- The eigenvalues of random symmetric matrices
- Recent results in the theory of graph spectra
- Pseudo-random hypergraphs
- A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets
- On Ramsey - Turan type theorems for hypergraphs
- Cyclotomy and difference families in elementary Abelian groups
- Dense expanders and pseudo-random bipartite graphs
- On Character Sums and Primitive Roots†
- Quasi-random tournaments
- Quasi-random hypergraphs
- Zero-One Laws for Sparse Random Graphs
- Diameters and Eigenvalues
- Quasi‐random classes of hypergraphs
- Regularity lemmas for hypergraphs and quasi-randomness
- Cohomological Aspects of Hypergraphs
- Probabilities on finite models
- A Constructive Solution to a Tournament Problem
- Imbalances in k‐colorations
- Quasi-random graphs
- Quasi-random graphs
