  The complexity of a maximum likelihood estimation is measured by its maximum
likelihood degree ($ML$ degree). In this paper we study the maximum likelihood
problem associated to chemical networks composed by one single chemical
reaction under the equilibrium assumption.
