Caro–Davila–Pepper independence–matching conjecture for cubic graphs

Let $G$ be a connected cubic, equivalently 3-regular, graph. Let $\alpha(G)$ denote the independence number of $G$, and let $\mu(G)$ denote its matching number. Caro–Davila–Pepper independence–matching conjecture. Then

$$\alpha(G)\leq\mu(G).$$

The conjecture is presented as an example of a TxGraffiti-generated relation between graph invariants. It was subsequently generalized and proved, so the original cubic-graph conjecture is solved.