The following pages link to Pseudo-random hypergraphs (Q1812585):
Displaying 25 items.
- Quasi-random subsets of \(\mathbb{Z}_ n\) (Q1194750) (← links)
- On testing the `pseudo-randomness' of a hypergraph (Q1195483) (← links)
- Hypergraphs, quasi-randomness, and conditions for regularity (Q1604564) (← links)
- No additional tournaments are quasirandom-forcing (Q2107498) (← links)
- Ample simplicial complexes (Q2115328) (← links)
- Quasirandom permutations are characterized by 4-point densities (Q2375768) (← links)
- On pseudo-random subsets of the set of the integers not exceeding \(N\) (Q2460691) (← links)
- Quasi-random multilinear polynomials (Q2631886) (← links)
- Dense expanders and pseudo-random bipartite graphs (Q2640620) (← links)
- Pseudo-random properties of self-complementary symmetric graphs (Q3159385) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Characterization of quasirandom permutations by a pattern sum (Q3386522) (← links)
- (Q3768936) (← links)
- FORCING QUASIRANDOMNESS WITH TRIANGLES (Q4632525) (← links)
- Quasi-Random Set Systems (Q4713353) (← links)
- On characterizing hypergraph regularity (Q4798170) (← links)
- Pseudorandom Graphs in Data Structures (Q5167805) (← links)
- The hypergraph regularity method and its applications (Q5385859) (← links)
- (Q5465363) (← links)
- Lower bound on the size of a quasirandom forcing set of permutations (Q5886321) (← links)
- Quasirandomness in hypergraphs (Q5915722) (← links)
- Quasirandom-Forcing Orientations of Cycles (Q6071821) (← links)
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs (Q6074706) (← links)
- Quasirandom Latin squares (Q6076738) (← links)
- Forcing generalised quasirandom graphs efficiently (Q6632790) (← links)
