Beyond the Runs Theorem

Johannes Fischer, Štěpán Holub, Tomohiro I +1

Recently, a short and elegant proof was presented showing that a binary word of length $n$ contains at most $n-3$ runs. Here we show, using the same technique and a computer search…