There are only two paradoxes

Using a graph representation of classical logic, the paper shows that the liar or Yablo pattern occurs in every semantic paradox. The core graph theoretic result generalizes theorem of Richardson, showing solvability of finite graphs without odd cycles, to arbitrary graphs which are proven solvable when no odd cycles nor patterns generalizing Yablo's occur. This follows from an earlier result by a new compactness-like theorem, holding for infinitary logic and utilizing the graph representation.
Comment: The proof of the main Theorem 3.7 has some flaws. A minor one, which can be fixed, is the choice of \mathcal{H} as "the set of all sinkless induced subgraphs of H having finitely many ends." A more serious one is that the proof could be used to establish an untrue claim. It is not clear yet what specific mistake causes it