On the growth of components with non fixed excesses

Anne-Elisabeth Baert, Vlady Ravelomanana, Loÿs Thimonier

Denote by an $l$-component a connected graph with $l$ edges more than vertices. We prove that the expected number of creations of $(l+1)$-component, by means of adding a new edge t…