1542 search results - page 30 / 309 » The metamathematics of random graphs |
COMBINATORICS
2006
15 years 1 months ago
2006
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
117
click to vote
DM
2011
14 years 8 months ago
2011
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
SSS
2010
Springer
14 years 12 months ago
2010
Springer
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
94
Voted
RSA
2006
15 years 1 months ago
2006
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...