3 citations · 9 across the 20 of their papers we have counts for
6 papers · 1 filter
The Maximum Block Size of Critical Random Graphs
Vonjy Rasendrahasina, Andry Rasoanaivo, Vlady Ravelomanana
Let be the uniform random graph with vertices and edges. Let be the maximum block-size of or the maximum size of its maximal -connected ind…
Another Proof of Wright's Inequalities
Vlady Ravelomanana
We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 - 407 (1980)] concerning the number of connected graphs with edges…
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…
Minimum Sum Edge Colorings of Multicycles
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assigne…
Creation and Growth of Components in a Random Hypergraph Process
Vlady Ravelomanana, Alphonse Laza Rijamame
Denote by an -component a connected -uniform hypergraph with edges and vertices. We prove that the expected number of creations of -component dur…
The Average Size of Giant Components Between the Double-Jump
Vlady Ravelomanana, the Projet PAI Amadeus Collaboration
We study the sizes of connected components according to their excesses during a random graph process built with vertices. The considered model is the continuous one defined in…