2 papers
cs.DM2007
On the growth of components with non fixed excesses
Anne-Elisabeth Baert, Vlady Ravelomanana, Loÿs Thimonier
Denote by an -component a connected graph with edges more than vertices. We prove that the expected number of creations of -component, by means of adding a new edge t…
cs.DS2004
Forbidden Subgraphs in Connected Graphs
Vlady Ravelomanana, Loys Thimonier
Given a set of connected non acyclic graphs, a -free graph is one which does not contain any member of as copy. Define the excess of a graph as the dif…