Costly network formation and regular equilibria

We prove that for generic network-formation games where players incur a strictly positive cost to propose links the number of Nash equilibria is finite. Furthermore all Nash equilibria are regular and, therefore, stable sets.