Quasirandom Latin squares
From MaRDI portal
Publication:6076738
DOI10.1002/rsa.21060zbMath1522.05018arXiv2011.07572OpenAlexW3213081841MaRDI QIDQ6076738
Jacob W. Cooper, Ander Lamaison, Daniel Král', Samuel Mohr
Publication date: 17 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.07572
Random graphs (graph-theoretic aspects) (05C80) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items
Transversals in quasirandom latin squares, Quasirandom-Forcing Orientations of Cycles, The number of \(n\)-queens configurations
Cites Work
- Unnamed Item
- On universality of graphs with uniformly distributed edges
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- Hypergraphs, quasi-randomness, and conditions for regularity
- Pseudo-random hypergraphs
- Quasirandom permutations
- Tournament quasirandomness from local counting
- Finitely forcible graphons
- Quasirandom permutations are characterized by 4-point densities
- A consistent test of independence based on a sign covariance related to Kendall's tau
- Hypergraph regularity and the multidimensional Szemerédi theorem
- On measures of association and a related problem
- Quasi-random tournaments
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Characterization of quasirandom permutations by a pattern sum
- Quasi-random hypergraphs
- Quasirandom Groups
- Weak regularity and finitely forcible graph limits
- Quasi-Random Set Systems
- On the Density of Transitive Tournaments
- A Non-Parametric Test of Independence
- Quasi-random graphs
