So I got my hands of the Google N-gram data for the Romanian
language. It’s noisy as hell, has some other subtle issues too, but
here’s the first thing I noticed:
The Romanian word for coffee is cafea, and the more you crave it, the
longer you pronunce …
I have been digging on the internet for the proof of this theorem for
the last couple of days without success. The result was published by Sir
Crispin Nash-Williams as Valency Sequences which force graphs to have
Hamiltonian Circuits. Interim Rep, University of Waterloo Res Rep.,
Waterloo, Ontario, 1969. However …