Quasi-Random Set Systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 4099367 (Why is no real title available?)
- scientific article; zbMATH DE number 15664 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 193109 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 3487460 (Why is no real title available?)
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 863492 (Why is no real title available?)
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- scientific article; zbMATH DE number 3056377 (Why is no real title available?)
- scientific article; zbMATH DE number 3061903 (Why is no real title available?)
- A Constructive Solution to a Tournament Problem
- A Mathematical Theory of Communication
- A diagonal form for the incidence matrices of t-subsets vs. k- subsets
- Cohomological Aspects of Hypergraphs
- Cyclotomy and difference families in elementary Abelian groups
- Dense expanders and pseudo-random bipartite graphs
- Diameters and Eigenvalues
- Graph theory with applications
- Graphs which contain all small graphs
- Imbalances in k‐colorations
- On Character Sums and Primitive Roots†
- On Ramsey - Turan type theorems for hypergraphs
- On universality of graphs with uniformly distributed edges
- Probabilities on finite models
- Pseudo-random hypergraphs
- Quasi-random graphs
- Quasi-random graphs
- Quasi-random hypergraphs
- Quasi-random tournaments
- Quasi‐random classes of hypergraphs
- Recent results in the theory of graph spectra
- Regularity lemmas for hypergraphs and quasi-randomness
- Some Ramsey-Turán type results for hypergraphs
- The eigenvalues of random symmetric matrices
- The number of submatrices of a given type in a Hadamard matrix and related results
- Zero-One Laws for Sparse Random Graphs
Cited in
(44)- Quasi-randomness of graph balanced cut properties
- No additional tournaments are quasirandom-forcing
- On hypergraphs having evenly distributed subhypergraphs
- Mathematical vanity plates
- Quasirandom arithmetic permutations
- On pseudo-random subsets of the set of the integers not exceeding \(N\)
- A note on even cycles and quasirandom tournaments
- Quasirandomness in hypergraphs
- Intersections of graphs
- The poset of hypergraph quasirandomness
- Ample simplicial complexes
- Quasi-random Boolean functions
- Perfect Packings in Quasirandom Hypergraphs II
- Characterization of quasirandom permutations by a pattern sum
- From quasirandom graphs to graph limits and graphlets
- Forcing generalized quasirandom graphs efficiently (extended abstract)
- Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
- Quasi-random oriented graphs
- scientific article; zbMATH DE number 1872987 (Why is no real title available?)
- Quasirandom-Forcing Orientations of Cycles
- Quasirandom permutations
- 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
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- Tournament quasirandomness from local counting
- Forcing quasirandomness in a regular tournament
- Linear quasi-randomness of subsets of abelian groups and hypergraphs
- Forcing generalised quasirandom graphs efficiently
- Constructing quasi-random subsets of \(\mathbb Z_N\) by using elliptic curves
- An approximate version of Sidorenko's conjecture
- Extremal results in sparse pseudorandom graphs
- Lower bound on the size of a quasirandom forcing set of permutations
- Some properties of a higher-order coboundary operator
- Forcing quasirandomness with triangles
- New Ramsey multiplicity bounds and search heuristics
- Hypergraphs, quasi-randomness, and conditions for regularity
- The quasi-randomness of hypergraph cut properties
- Quasirandom Latin squares
- Quasi-random hypergraphs revisited
- Weak quasi-randomness for uniform hypergraphs
- Cohomological Aspects of Hypergraphs
- A sharp lower bound for the number of mappings of a linear graph into an arbitrary graph and an inequality of A. F. Sidorenko
- scientific article; zbMATH DE number 1506506 (Why is no real title available?)
- Quasirandom permutations are characterized by 4-point densities
This page was built for publication: Quasi-Random Set Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4713353)
