Component evolution in random intersection graphs.
Behrisch, Michael (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Planarity thresholds for two types of random subgraphs of the -cube”
Component evolution in random intersection graphs.
Encores on cores.
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On percolation in random graphs with given vertex degrees.
Janson, Svante (2009)
Electronic Journal of Probability [electronic only]
Similarity:
On vertex, edge, and vertex-edge random graphs.
Beer, Elizabeth, Fill, James Allen, Janson, Svante, Scheinerman, Edward R. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The largest component in an inhomogeneous random intersection graph with clustering.
Bloznelis, Mindaugas (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Almost every bipartite graph has not two vertices of minimum degree
József Bukor (1993)
Mathematica Slovaca
Similarity:
A note on the component structure in random intersection graphs with tunable clustering.
Lagerås, Andreas N., Lindholm, Mathias (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Coloring the edges of a random graph without a monochromatic giant component.
Spöhel, Reto, Steger, Angelika, Thomas, Henning (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: