The discriminant can never be $\pm 1$. This follows from ramfication theory. If you let $\alpha$ be a root of your polynomial, then some prime will always ramify in the extension $\mathbb{Q}(\alpha)$ and such a prime must divide the discriminant. This is called Minkowski's theorem. Look it up in any book on algebraic number theory.
The same theory tells us that $3$ is the smallest absolute value of the discriminant of any number field besides ${\mathbb{Q}}$. This absolute value happens for ${\mathbb{Q}}(\sqrt{-3})$. Given any monic irreducible polynomial in $\mathbb{Z}[X]$ and a root $\alpha$ of the polynomial, the discriminant of the number field $\mathbb{Q}(\alpha)$ will always be less (in absolute value) than the discriminant of the polynomial (it's the discriminant of a polynomial divided by some of its square factors). Minkowki's theorem give us the following bound for the discriminant of a number field $K/\mathbb{Q}$ of degree $n$:
$\sqrt{|d_K|}\geq \frac{n^n}{n!}\left(\frac{\pi}{4}\right)^{n/2}$
The lower bound is strictly increasing for each $n$, so you can easily see that small discriminants are only possible for irreducible polynomials of small degree.
Since the discriminant of any number field beside ${\mathbb Q}$ has absolute value at least $3$ and there's an irreducible polynomial $X^2+X+1\in\mathbb{Z}[X]$ with discriminant $-3$, we see that $3$ is also the lower bound for the absolute value of the discriminant of any irreducible polynomial of degree greater than 1.