The n-queens problem is to determine Q (n), the number of ways to place n mutually non-
threatening queens on an n× n board. We show that there exists a constant α= 1.942±3× …

A sequence $\pi_1,\pi_2,\dots $ of permutations is said to be" quasirandom" if the induced
density of every permutation $\sigma $ in $\pi_n $ converges to $1/|\sigma|! $ as $ n\to\infty …

A transversal in an n× nn*n latin square is a collection of nn entries not repeating any row,
column, or symbol. Kwan showed that almost every n× nn*n latin square has (1+ o (1)) n/e 2 …

The theory of quasirandomness has greatly expanded from its inaugural graph theoretical
setting to several different combinatorial objects such as hypergraphs, tournaments …

We develop a limit theory of Latin squares, paralleling the recent limit theories of dense
graphs and permutations. We introduce a notion of density, an appropriate version of the cut …

The acyclic chromatic number of a graph is the least number of colors needed to properly
color its vertices so that none of its cycles has only two colors. The acyclic chromatic index is …

A set S of permutations is forcing if for any sequence of permutations where the density
converges to for every permutation, it holds that is quasirandom. Graham asked whether …

An oriented graph is quasirandom-forcing if the limit (homomorphism) density of in a
sequence of tournaments is if and only if the sequence is quasirandom. We study …

A tournament $ H $ is said to\emph {force quasirandomness} if it has the property that a
sequence $(T_n) _ {n\in\mathbb {N}} $ of tournaments of increasing orders is quasirandom if …

We study generalised quasirandom graphs whose vertex set consists of $ q $ parts (of not
necessarily the same sizes) with edges within each part and between each pair of parts …