A quasirandom graph sequence is a sequence of finite simple graphs whose asymptotic subgraph counts have the values predicted by a random
graph. More precisely, 
with 
is 
-quasirandom if, for every fixed finite simple
graph 
with 
vertices and 
edges, the number of labeled
injective copies of 
is 
.
The copies need not be induced subgraphs. Here
is fixed, and 
denotes little-O notation.
The Janson-Sós conjecture characterizes this property using a single graph 
and counts restricted to balanced disjoint vertex classes
(Wang et al. 2026).
