  The pantograph differential equation and its solution, the deformed
exponential function, are remarkable objects that appear in areas as diverse as
combinatorics, number theory, statistical mechanics, and electrical
engineering. In this article we describe a new surprising application of these
objects in graph theory, by showing that the set of all cliques is not forcing
for quasirandomness. This provides a natural example of an infinite family of
graphs, which is not forcing, and answers a natural question posed by P. Horn.
