Quasirandom permutations are characterized by 4-point densities
Top Cited Papers
Open Access
- 19 March 2013
- journal article
- Published by Springer Nature in Geometric and Functional Analysis
- Vol. 23 (2) , 570-579
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Finitely forcible graphonsJournal of Combinatorial Theory, Series B, 2011
- Hypergraph regularity and the multidimensional Szemerédi theoremAnnals of Mathematics, 2007
- Quasirandom permutationsJournal of Combinatorial Theory, Series A, 2004
- Hypergraphs, Quasi-randomness, and Conditions for RegularityJournal of Combinatorial Theory, Series A, 2002
- The Distributions of the Entries of Young TableauxJournal of Combinatorial Theory, Series A, 2002
- Quasi-random subsets of ZnJournal of Combinatorial Theory, Series A, 1992
- Quasi‐random tournamentsJournal of Graph Theory, 1991
- Quasi-random set systemsJournal of the American Mathematical Society, 1991
- Pseudo-random hypergraphsDiscrete Mathematics, 1989
- On universality of graphs with uniformly distributed edgesDiscrete Mathematics, 1986