On the quality of the ABC-solutions

Let the triple $(a, b, c)$ of integers be such that $\gcd{\left(a, b, c\right)} = 1$ and $a + b = c$. We call such a triple an ABC-solution. The quality of an ABC-solution $(a, b, c)$ is defined as
$$q(a, b, c) = \frac{\max\left\{\log |a|, \log |b|, \log |c|\right\}}{\log \operatorname{rad}\left({|abc|}\right)}$$
where $\operatorname{rad} (|abc|)$ is the product of distinct prime factors of $|abc|$. The ABC-conjecture states that given $\epsilon >0$ the number of the ABC-solutions $(a, b, c)$ with $q(a, b, c)\geq 1 + \epsilon$ is finite. In the first part of this talk, under the ABC-conjecture, we explore the quality of certain families of the ABC-solutions formed by terms in Lucas and associated Lucas sequences. We also introduce, unconditionally, a new family of ABC-solutions that has quality $> 1$. In the remainder of the talk, we provide a result on a conjecture of Erdõs on the solutions of the Brocard-Ramanujan equation
$$n! + 1 = m^2$$
by assuming an explicit version of the ABC-conjecture proposed by Baker.